Method and device for transmitting channel state information in wireless communication system

ABSTRACT

The present invention relates to a wireless communication system. A method for transmitting channel state information (CSI) in a wireless communication system, according to one embodiment of the present invention, comprises steps of: subsampling a codebook for a four-antenna port including 16 precoding matrices; and performing feedback for the CSI on the basis of a subsampled codebook, wherein when a rank indicator (RI) is four, a subsampled codebook includes, from 16 precoding matrices, a first precoding matrix having index 0, a third precoding matrix having index 2, a ninth precoding matrix having index 8, and an eleventh precoding matrix having index 10.

TECHNICAL FIELD

The present invention relates to a wireless communication system, and more particularly, to a method and apparatus for transmitting channel state information using subsampling of a codebook in a wireless communication system.

Background Art

A 3rd generation partnership project long term evolution (3GPP LTE) communication system will be described below as an exemplary mobile communication system to which the present invention is applicable.

FIG. 1 is a diagram schematically showing a network structure of an evolved universal mobile telecommunications system (E-UMTS) as an exemplary radio communication system. The E-UMTS system has evolved from the conventional UMTS system and basic standardization thereof is currently underway in the 3GPP. The E-UMTS may be generally referred to as a long term evolution (LTE) system. For details of the technical specifications of the UMTS and E-UMTS, refer to Release 7 and Release 8 of “3rd generation partnership project; technical specification group radio access network”.

Referring to FIG. 1, the E-UMTS includes a user equipment (UE), eNBs (or eNode Bs or base stations), and an access gateway (AG) which is located at an end of a network (E-UTRAN) and connected to an external network. The eNBs may simultaneously transmit multiple data streams for a broadcast service, a multicast service, and/or a unicast service.

One or more cells may exist per eNB. A cell is set to use one of bandwidths of 1.25, 2.5, 5, 10, 15, and 20 MHz to provide a downlink or uplink transport service to several UEs. Different cells may be set to provide different bandwidths. The eNB controls data transmission and reception for a plurality of UEs. The eNB transmits downlink scheduling information with respect to downlink data to notify a corresponding UE of a time/frequency domain in which data is to be transmitted, coding, data size, and hybrid automatic repeat and request (HARQ)-related information. In addition, the eNB transmits uplink scheduling information with respect to UL data to a corresponding UE to inform the UE of an available time/frequency domain, coding, data size, and HARQ-related information. An interface for transmitting user traffic or control traffic may be used between eNBs. A core network (CN) may include the AG, a network node for user registration of the UE, and the like. The AG manages mobility of a UE on a tracking area (TA) basis, wherein one TA includes a plurality of cells.

Although radio communication technology has been developed up to LTE based on wideband code division multiple access (WCDMA), the demands and expectations of users and providers continue to increase. In addition, since other radio access technologies continue to be developed, new technology is required to secure competitiveness in the future. For example, decrease of cost per bit, increase of service availability, flexible use of a frequency band, simple structure, open interface, and suitable power consumption by a UE are required.

Multiple-input multiple-output (MIMO) technology refers to a method for enhancing transmission and receiving data efficiency by employing multiple transmit antennas and multiple receive antennas instead of one transmit antenna and one receive antenna. That is, the MIMO technology enhances capacity or improves performance using multiple antennas in a transmitting end or a receiving end of a wireless communication system. The MIMO technology may also be referred to as multiple antenna technology.

In order to support multiple antenna transmission, a precoding matrix for appropriately distributing transmitted information according to a channel situation and so on can be applied to each antenna.

DISCLOSURE Technical Problem

An object of the present invention devised to solve the problem lies in a method and apparatus for transmitting channel state information in a wireless communication system.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

Technical Solution

The object of the present invention can be achieved by providing a method for transmitting channel state information (CSI) by a user equipment (UE) in a wireless communication system, the method including subsampling a codebook for a 4 antenna port including 16 precoding matrices, and feedbacking the CSI based on the subsampled codebook, wherein, when a rank indicator (RI) is 4, the subsampled codebook includes a first precoding matrix with index 0, a third precoding matrix with index 2, and a ninth precoding matrix with index 8, and an eleventh precoding matrix with index 10 among the 16 precoding matrices.

In another aspect of the present invention, provided herein is a user equipment (UE) for transmitting channel state information (CSI) in a wireless communication system, the UE including a radio frequency (RF) unit, and a processor, wherein the processor is configured to subsample a codebook for a 4 antenna port including 16 precoding matrices and to feedback the CSI based on the subsampled codebook, and when a rank indicator (RI) is 4, the subsampled codebook includes a first precoding matrix with index 0, a third precoding matrix with index 2, and a ninth precoding matrix with index 8, and an eleventh precoding matrix with index 10 among the 16 precoding matrices.

The following features may be commonly applied to the above embodiments of the present invention.

The first precoding matrix may be configured as

$W_{0} = {{\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- 1} & {- 1} & 1 \end{bmatrix}}.}$

The third precoding matrix may be configured according as

$W_{2} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \end{bmatrix}}.}$

The ninth precoding matrix may be configured according as

$W_{8} = {{\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} \\ {- 1} & 1 & {- 1} & 1 \end{bmatrix}}.}$

The eleventh precoding matrix may be configured according as

$W_{10} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & 1 \\ {- 1} & 1 & {- 1} & 1 \\ {- 1} & {- 1} & 1 & 1 \\ 1 & 1 & 1 & 1 \end{bmatrix}}.}$

The subsampling may include subsampling the codebook for the 4 antenna port according to

2I_(PMI2)+4·└I_(PMI2)/2┘.

The I_(PMI2) may indicate an index of a precoding matrix with one of 0 to 3.

The subsampling may include subsampling a precoding matrix including only a real value among the 16 precoding matrices.

The subsampling may include subsampling a precoding matrix corresponding to a binary phase shift keying (BPSK) modulation method among the 16 precoding matrices.

The subsampling may include subsampling a precoding matrix including a value corresponding to an X-pol (cross polarization) antenna among the 16 precoding matrices.

A second precoding matrix among the 16 precoding matrices may be configured as

$W_{1} = {{\frac{1}{2}\begin{bmatrix} 1 & {- j} & {- 1} & j \\ j & 1 & j & 1 \\ {- 1} & {- j} & 1 & j \\ {- j} & 1 & {- j} & 1 \end{bmatrix}}.}$

A fourth precoding matrix may he configured as

$W_{3} = {{\frac{1}{2}\begin{bmatrix} 1 & j & {- 1} & {- j} \\ {- j} & 1 & {- j} & 1 \\ {- 1} & j & 1 & {- j} \\ j & 1 & j & 1 \end{bmatrix}}.}$

A fifth precoding matrix may be configured as

$W_{4} = {{\frac{1}{2}\begin{bmatrix} 1 & \frac{1 - j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} & j \\ j & \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} & 1 \end{bmatrix}}.}$

A sixth precoding matrix may be configured as

$W_{5} = {{\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} - j}{\sqrt{2}} & j & \frac{1 - j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} & {- j} \\ {- j} & \frac{1 - j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & j & \frac{1 - j}{\sqrt{2}} & 1 \end{bmatrix}}.}$

A seventh precoding matrix may be configured as

$W_{6} = {{\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} & j \\ j & \frac{1 + j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} & 1 \end{bmatrix}}.}$

An eighth precoding matrix may be configured as

$W_{7} = {{\frac{1}{2}\begin{bmatrix} 1 & \frac{1 + j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} & {- j} \\ {- j} & \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} & 1 \end{bmatrix}}.}$

A tenth precoding matrix may be configured as

$W_{9} = {{\frac{1}{2}\begin{bmatrix} 1 & {- j} & 1 & {- j} \\ j & 1 & {- j} & {- 1} \\ 1 & j & 1 & j \\ j & {- 1} & {- j} & 1 \end{bmatrix}}.}$

A twelfth precoding matrix may be configured as

$W_{11} = {{\frac{1}{2}\begin{bmatrix} 1 & j & 1 & j \\ {- j} & 1 & j & {- 1} \\ 1 & {- j} & 1 & {- j} \\ {- j} & {- 1} & j & 1 \end{bmatrix}}.}$

A thirteenth precoding matrix may be configured as

$W_{12} = {{\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & {- 1} \\ 1 & 1 & {- 1} & 1 \\ 1 & {- 1} & 1 & 1 \\ {- 1} & 1 & 1 & 1 \end{bmatrix}}.}$

A fourteenth precoding matrix may be configured as

$W_{13} = {{\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & 1 \\ 1 & 1 & 1 & {- 1} \\ {- 1} & 1 & 1 & 1 \\ 1 & {- 1} & 1 & 1 \end{bmatrix}}.}$

A fifteenth precoding matrix may be configured as

$W_{14} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & 1 \\ {- 1} & 1 & 1 & 1 \\ 1 & 1 & 1 & {- 1} \\ 1 & 1 & {- 1} & 1 \end{bmatrix}}.}$

A sixteenth precoding matrix may be configured as

$W_{15} = \frac{1}{2}$

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

Advantageous Effects

According to embodiments of the present invention, a method and apparatus for effectively transmitting channel state information using subsampling of a codebook in a wireless communication system is provided.

It will be appreciated by persons skilled in the art that that the effects that could be achieved with the present invention are not limited to what has been particularly described hereinabove and other advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings.

DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.

In the drawings:

FIG. 1 is a diagram schematically showing a network structure of an evolved universal mobile telecommunications system (E-UMTS) as an exemplary radio communication system;

FIG. 2 is a diagram illustrating a control plane and a user plane of a radio interface protocol between a UE and an evolved universal terrestrial radio access network (E-UTRAN) based on a 3rd generation partnership project (3GPP) radio access network standard;

FIG. 3 is a diagram showing physical channels used in a 3GPP system and a general signal transmission method using the same;

FIG. 4 is a diagram illustrating an example of the structure of a radio frame used in a long term evolution (LTE) system;

FIG. 5 is a diagram illustrating a control channel included in a control region of a subframe in a downlink radio frame;

FIG. 6 is a diagram illustrating an uplink subframe structure used in an LTE system;

FIG. 7 illustrates the configuration of a typical multiple input multiple output (MIMO) communication system;

FIGS. 8 to 11 illustrate periodic reporting of channel state information (CSI);

FIGS. 12 and 13 illustrate an exemplary process for periodically reporting CSI when a non-hierarchical codebook is used;

FIG. 14 is a diagram illustrating periodic reporting of CSI when a hierarchical codebook is used;

FIG. 15 is a flowchart of a method for transmitting channel state information according to the present invention; and

FIG. 16 is a diagram illustrating a BS and a UE to which an embodiment of the present invention is applicable.

BEST MODE

Hereinafter, the structures, operations, and other features of the present invention will be understood readily from the embodiments of the present invention, examples of which are described with reference to the accompanying drawings. The embodiments which will be described below are examples in which the technical features of the present invention are applied to a 3GPP system.

Although the embodiments of the present invention will be described based on an LTE system and an LTE-Advanced (LTE-A) system, the LTE system and the LTE-A system are only exemplary and the embodiments of the present invention can be applied to all communication systems corresponding to the aforementioned definition. In addition, although the embodiments of the present invention will herein be described based on Frequency Division Duplex (FDD) mode, the FDD mode is only exemplary and the embodiments of the present invention can easily be modified and applied to Half-FDD (H-FDD) mode or Time Division Duplex (TDD) mode.

FIG. 2 is a view illustrating structures of a control plane and a user plane of a radio interface protocol between a UE and an E-UTRAN based on the 3GPP radio access network specification. The control plane refers to a path through which control messages used by a User Equipment (UE) and a network to manage a call are transmitted. The user plane refers to a path through which data generated in an application layer, e.g. voice data or Internet packet data, is transmitted.

A physical layer of a first layer provides an information transfer service to an upper layer using a physical channel. The physical layer is connected to a Medium Access Control (MAC) layer of an upper layer via a transport channel Data is transported between the MAC layer and the physical layer via the transport channel. Data is also transported between a physical layer of a transmitting side and a physical layer of a receiving side via a physical channel The physical channel uses time and frequency as radio resources. Specifically, the physical channel is modulated using an Orthogonal Frequency Division Multiple Access (OFDMA) scheme in downlink and is modulated using a Single-Carrier Frequency Division Multiple Access (SC-FDMA) scheme in uplink.

A MAC layer of a second layer provides a service to a Radio Link Control (RLC) layer of an upper layer via a logical channel. The RLC layer of the second layer supports reliable data transmission. The function of the RLC layer may be implemented by a functional block within the MAC. A Packet Data Convergence Protocol (PDCP) layer of the second layer performs a header compression function to reduce unnecessary control information for efficient transmission of an Internet Protocol (IP) packet such as an IPv4 or IPv6 packet in a radio interface having a relatively narrow bandwidth.

A Radio Resource Control (RRC) layer located at the bottommost portion of a third layer is defined only in the control plane. The RRC layer controls logical channels, transport channels, and physical channels in relation to configuration, re-configuration, and release of radio bearers. The radio bearers refer to a service provided by the second layer to transmit data between the UE and the network. To this end, the RRC layer of the UE and the RRC layer of the network exchange RRC messages. The UE is in an RRC connected mode if an RRC connection has been established between the RRC layer of the radio network and the RRC layer of the UE. Otherwise, the UE is in an RRC idle mode. A Non-Access Stratum (NAS) layer located at an upper level of the RRC layer performs functions such as session management and mobility management.

One cell of an eNB is set to use one of bandwidths such as 1.25, 2.5, 5, 10, 15, and 20 MHz to provide a downlink or uplink transmission service to a plurality of UEs. Different cells may be set to provide different bandwidths.

Downlink transport channels for data transmission from a network to a UE include a Broadcast Channel (BCH) for transmitting system information, a Paging Channel (PCH) for transmitting paging messages, and a downlink Shared Channel (SCH) for transmitting user traffic or control messages. Traffic or control messages of a downlink multicast or broadcast service may be transmitted through the downlink SCH or may be transmitted through an additional downlink Multicast Channel (MCH). Meanwhile, uplink transport channels for data transmission from the UE to the network include a Random Access Channel (RACH) for transmitting initial control messages and an uplink SCH for transmitting user traffic or control messages. Logical channels, which are located at an upper level of the transport channels and are mapped to the transport channels, include a Broadcast Control Channel (BCCH), a Paging Control Channel (PCCH), a Common Control Channel (CCCH), a Multicast Control Channel (MCCH), and a Multicast Traffic Channel (MTCH).

FIG. 3 is a view illustrating physical channels used in a 3GPP system and a general signal transmission method using the same.

A UE performs initial cell search such as establishment of synchronization with an eNB when power is turned on or the UE enters a new cell (step S301). The UE may receive a Primary Synchronization Channel (P-SCH) and a Secondary Synchronization Channel (S-SCH) from the eNB, establish synchronization with the eNB, and acquire information such as a cell identity (ID). Thereafter, the UE may receive a physical broadcast channel from the eNB to acquire broadcast information within the cell. Meanwhile, the UE may receive a Downlink Reference Signal (DL RS) in the initial cell search step to confirm a downlink channel state.

Upon completion of initial cell search, the UE may receive a Physical Downlink Control Channel (PDCCH) and a Physical Downlink Shared Channel (PDSCH) according to information carried on the PDCCH to acquire more detailed system information (step S302).

Meanwhile, if the UE initially accesses the eNB or if radio resources for signal transmission are not present, the UE may perform a random access procedure (steps S303 to S306) with respect to the eNB. To this end, the UE may transmit a specific sequence through a Physical Random Access Channel (PRACH) as a preamble (steps S303 and S305), and receive a response message to the preamble through the PDCCH and the PDSCH corresponding thereto (steps S304 and S306). In the case of a contention-based RACH, a contention resolution procedure may be additionally performed.

The UE which performs the above procedures may receive a PDCCH/PDSCH (step S307) and transmit a Physical Uplink Shared Channel (PUSCH)/Physical Uplink Control Channel (PUCCH) (step S308) according to a general uplink/downlink signal transmission procedure. Especially, the UE receives Downlink Control Information (DCI) through the PDCCH. The DCI includes control information such as resource allocation information for the UE and has different formats according to use purpose.

Meanwhile, control information, transmitted by the UE to the eNB through uplink or received by the UE from the eNB through downlink, includes a downlink/uplink ACKnowledgment/Negative ACKnowledgment (ACK/NACK) signal, a Channel Quality Indicator (CQI), a Precoding Matrix Index (PMI), a Rank Indicator (RI), and the like. In the case of the 3GPP LTE system, the UE may transmit control information such as CQI/PMI/RI through the PUSCH and/or the PUCCH.

FIG. 4 is a view illustrating the structure of a radio frame used in an LTE system.

Referring to FIG. 4, the radio frame has a length of 10 ms (327200 Ts) and includes 10 equally-sized subframes. Each of the subframes has a length of 1 ms and includes two slots. Each of the slots has a length of 0.5 ms (15360 Ts). In this case, Ts denotes sampling time and is represented by Ts=1/(15 kHz×2048)=3.2552×10−8 (about 33 ns). Each slot includes a plurality of OFDM symbols in a time domain and includes a plurality of Resource Blocks (RBs) in a frequency domain. In the LTE system, one resource block includes 12 subcarriers×7 (or 6) OFDM symbols. A Transmission Time Interval (TTI), which is a unit time for data transmission, may be determined in units of one or more subframes. The above-described structure of the radio frame is purely exemplary and various modifications may be made in the number of subframes included in a radio frame, the number of slots included in a subframe, or the number of OFDM symbols included in a slot.

FIG. 5 is a view illustrating control channels contained in a control region of one subframe in a downlink radio frame.

Referring to FIG. 5, one subframe includes 14 OFDM symbols. The first to third ones of the 14 OFDM symbols may be used as a control region and the remaining 13 to 11 OFDM symbols may be used as a data region, according to subframe configuration. In FIGS. 5, R1 to R4 represent reference signals (RSs) or pilot signals for antennas 0 to 3, respectively. The RSs are fixed to a predetermined pattern within the subframe irrespective of the control region and the data region. Control channels are allocated to resources to which the RS is not allocated in the control region. Traffic channels are allocated to resources, to which the RS is not allocated, in the data region. The control channels allocated to the control region include a Physical Control Format Indicator Channel (PCFICH), a Physical Hybrid-ARQ Indicator Channel (PHICH), a Physical Downlink Control Channel (PDCCH), etc.

The PCFICH, physical control format indicator channel, informs a UE of the number of OFDM symbols used for the PDCCH per subframe. The PCFICH is located in the first OFDM symbol and is established prior to the PHICH and the PDCCH. The PCFICH is comprised of 4 Resource Element Groups (REGs) and each of the REGs is distributed in the control region based on a cell ID. One REG includes 4 Resource Elements (REs). The RE indicates a minimum physical resource defined as one subcarrier x one OFDM symbol. The PCFICH value indicates values of 1 to 3 or values of 2 to 4 depending on bandwidth and is modulated by Quadrature Phase Shift Keying (QPSK).

The PHICH, physical Hybrid-ARQ indicator channel, is used to transmit a HARQ ACK/NACK signal for uplink transmission. That is, the PHICH indicates a channel through which downlink ACK/NACK information for uplink HARQ is transmitted. The PHICH includes one REG and is cell-specifically scrambled. The ACK/NACK signal is indicated by 1 bit and is modulated by Binary Phase Shift Keying (BPSK). The modulated ACK/NACK signal is spread by a Spreading Factor (SF)=2 or 4. A plurality of PHICHs mapped to the same resource constitutes a PHICH group. The number of PHICHs multiplexed to the PHICH group is determined depending on the number of SFs. The PHICH (group) is repeated three times to obtain diversity gain in a frequency domain and/or a time domain.

The PDCCH, physical downlink control channel, is allocated to the first n OFDM symbols of a subframe. In this case, n is an integer greater than 1 and is indicated by the PCFICH. The PDCCH is comprised of one or more Control Channel Elements (CCEs). The PDCCH informs each UE or UE group of information associated with resource allocation of a Paging Channel (PCH) and a Downlink-Shared Channel (DL-SCH), uplink scheduling grant, Hybrid Automatic Repeat Request (HARQ) information, etc. Therefore, an eNB and a UE transmit and receive data other than specific control information or specific service data through the PDSCH.

Information indicating to which UE or UEs PDSCH data is to be transmitted, information indicating how UEs are to receive PDSCH data, and information indicating how UEs are to perform decoding are contained in the PDCCH. For example, it is assumed that a specific PDCCH is CRC-masked with a Radio Network Temporary Identity (RNTI) “A” and information about data, that is transmitted using radio resources “B” (e.g., frequency location) and transport format information “C” (e.g., transmission block size, modulation scheme, coding information, etc.), is transmitted through a specific subframe. In this case, a UE located in a cell monitors the PDCCH using its own RNTI information. If one or more UEs having the RNTI ‘A’ are present, the UEs receive the PDCCH and receive the PDSCH indicated by ‘B’ and ‘C’ through the received PDCCH information.

FIG. 6 illustrates the structure of an uplink subframe used in the LTE system.

Referring to FIG. 6, an uplink subframe is divided into a region to which a PUCCH is allocated to transmit control information and a region to which a PUSCH is allocated to transmit user data. The PUSCH is allocated to the middle of the subframe, whereas the PUCCH is allocated to both ends of a data region in the frequency domain The control information transmitted on the PUCCH includes an ACK/NACK, a CQI representing a downlink channel state, an RI for Multiple Input and Multiple Output (MIMO), a Scheduling Request (SR) indicating a request for allocation of uplink resources, etc. A PUCCH of a UE occupies one RB in a different frequency in each slot of a subframe. That is, two RBs allocated to the PUCCH frequency-hop over the slot boundary. Particularly, FIG. 6 illustrates an example in which PUCCHs for m=0, m=1, m=2, and m=3 are allocated to a subframe.

Hereinafter, a MIMO system will be described. MIMO refers to a method of using multiple transmission antennas and multiple reception antennas to improve data transmission/reception efficiency. Namely, a plurality of antennas is used at a transmitting end or a receiving end of a wireless communication system so that capacity can be increased and performance can be improved. MIMO may also be referred to as ‘multi-antenna’ in this disclosure.

MIMO System

MIMO technology does not depend on a single antenna path in order to receive a whole message. Instead, MIMO technology collects data fragments received via several antennas, merges the data fragments, and forms complete data. The use of MIMO technology can increase system coverage while improving data transfer rate within a cell area of a specific size or guaranteeing a specific data transfer rate. MIMO technology can be widely used in mobile communication terminals and relay nodes. MIMO technology can overcome the limitations of the restricted amount of transmission data of single antenna based mobile communication systems.

The configuration of a general MIMO communication system is shown in FIG. 7. A transmitting end is equipped with NT transmission (Tx) antennas and a receiving end is equipped with NR reception (Rx) antennas. If a plurality of antennas is used both at the transmitting end and at the receiving end, theoretical channel transmission capacity increases unlike the case where only either the transmitting end or the receiving end uses a plurality of antennas. Increase in channel transmission capacity is proportional to the number of antennas, thereby improving transfer rate and frequency efficiency. If a maximum transfer rate using a signal antenna is Ro, a transfer rate using multiple antennas can be theoretically increased by the product of the maximum transfer rate Ro by a rate increment Ri. The rate increment Ri is represented by the following equation 1 where Ri is the smaller of NT and NR.

R _(i)=min(N _(T) , N _(R))   [Equation 1]

For example, in a MIMO communication system using four Tx antennas and four Rx antennas, it is possible to theoretically acquire a transfer rate four times that of a single antenna system. After theoretical increase in the capacity of the MIMO system was first demonstrated in the mid-1990s, various techniques for substantially improving data transfer rate have been under development. Several of these techniques have already been incorporated into a variety of wireless communication standards including, for example, 3rd generation mobile communication and next-generation wireless local area networks.

Active research up to now related to MIMO technology has focused upon a number of different aspects, including research into information theory related to MIMO communication capacity calculation in various channel environments and in multiple access environments, research into wireless channel measurement and model derivation of MIMO systems, and research into space-time signal processing technologies for improving transmission reliability and transfer rate.

To describe a communication method in a MIMO system in detail, a mathematical model thereof is given below. As shown in FIG. 7, it is assumed that NT Tx antennas and NR Rx antennas are present. In the case of a transmission signal, a maximum number of transmittable pieces of information is NT under the condition that NT Tx antennas are used, so that transmission information can be represented by a vector represented by the following equation 2:

s=└s₁, s₂, . . . , s_(N) _(T) ┘^(T)   [Equation 2]

Meanwhile, individual transmission information pieces s₁, s₂, . . . , s_(N) _(T) may have different transmission powers. In this case, if the individual transmission powers are denoted by P₁, P₂, . . . , P_(N) _(T) , transmission information having adjusted transmission powers can be represented by a vector shown in the following equation 3:

ŝ=[ŝ₁, ŝ₂, . . . , ŝ_(N) _(T) ]^(T)=[P₁s₁, P₂s₂, . . . , P_(N) _(T) s_(N) _(T) ]^(T)   [Equation 3]

The transmission power-controlled transmission information vector ŝ may be expressed as follows, using a diagonal matrix P of a transmission power:

$\begin{matrix} {\hat{s} = {{\begin{bmatrix} P_{1} & \; & \; & {\; 0} \\ \; & P_{2} & \; & \; \\ \; & \; & \ddots & \; \\ 0 & \; & \; & P_{N_{T}} \end{bmatrix}\begin{bmatrix} s_{1} \\ s_{2} \\ \vdots \\ s_{N_{T}} \end{bmatrix}} = {Ps}}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack \end{matrix}$

NT transmission signals x₁, x₂, . . . , x_(N) _(T) to be actually transmitted may be configured by multiplying the transmission power-controlled information vector ŝ by a weight matrix W. In this case, the weight matrix is adapted to properly distribute transmission information to individual antennas according to transmission channel situations. The transmission signals x₁, x₂, . . . , x_(N) _(y) can be represented by the following Equation 5 using a vector X. In Equation 5, is a weight between the i-th Tx antenna and the j-th information and W is a weight matrix, which may also be referred to as a precoding matrix.

$\begin{matrix} {x = {\quad{\begin{bmatrix} x_{1} \\ x_{2} \\ \vdots \\ x_{i} \\ \vdots \\ x_{N_{T}} \end{bmatrix} = {{\begin{bmatrix} w_{11} & w_{12} & \ldots & w_{1N_{T}} \\ w_{21} & w_{22} & \ldots & w_{2N_{T}} \\ \vdots & \; & \ddots & \; \\ w_{i\; 1} & w_{i\; 2} & \ldots & w_{{iN}_{T}} \\ \vdots & \; & \ddots & \; \\ w_{N_{T}1} & w_{N_{T}2} & \ldots & w_{N_{T}N_{T}} \end{bmatrix}\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \\ \vdots \\ {\hat{s}}_{j} \\ \vdots \\ {\hat{s}}_{N_{T}} \end{bmatrix}} = {{\hat{W}s} = {WPs}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack \end{matrix}$

Generally, the physical meaning of a rank of a channel matrix may be a maximum number of different pieces of information that can be transmitted in a given channel. Accordingly, since the rank of the channel matrix is defined as the smaller of the number of rows or columns, which are independent of each other, the rank of the matrix is not greater than the number of rows or columns. A rank of a channel matrix H, rank(H), is restricted as follows.

rank(H)≦min(N _(T) , N _(R))   [Equation 6]

Each unit of different information transmitted using MIMO technology is defined as a ‘transmission stream’ or simply ‘stream’. The ‘stream’ may be referred to as a ‘layer’. The number of transmission streams is not greater than a rank of a channel which is a maximum number of different pieces of transmittable information. Accordingly, the channel matrix H may be indicted by the following Equation 7:

#of streams≦rank(H)≦min(N _(T) , N _(R))   [Equation 7]

where ‘# of streams’ denotes the number of streams. It should be noted that one stream may be transmitted through one or more antennas.

There may be various methods of allowing one or more streams to correspond to multiple antennas. These methods may be described as follows according to types of MIMO technology. The case where one stream is transmitted via multiple antennas may be called spatial diversity, and the case where multiple streams are transmitted via multiple antennas may be called spatial multiplexing. It is also possible to configure a hybrid of spatial diversity and spatial multiplexing.

CSI Feedback

Now, a description of a Channel State Information (CSI) report is given. In the current LTE standard, a MIMO transmission scheme is categorized into open-loop MIMO operated without CSI and closed-loop MIMO operated based on CSI. Especially, according to the closed-loop MIMO system, each of the eNB and the UE may be able to perform beamforming based on CSI to obtain a multiplexing gain of MIMO antennas. To obtain CSI from the UE, the eNB allocates a PUCCH or a PUSCH to command the UE to feed back CSI for a downlink signal.

CSI is divided into three types of information: a Rank Indicator (RI), a Precoding Matrix Index (PMI), and a Channel Quality Indicator (CQI). First, RI is information on a channel rank as described above and indicates the number of streams that can be received via the same time-frequency resource. Since RI is determined by long-term fading of a channel, it may be generally fed back at a cycle longer than that of PMI or CQI.

Second, PMI is a value reflecting a spatial characteristic of a channel and indicates a precoding matrix index of the eNB preferred by the UE based on a metric of Signal-to-Interference plus Noise Ratio (SINR). Lastly, CQI is information indicating the strength of a channel and indicates a reception SINR obtainable when the eNB uses PMI.

In an evolved communication system such as an LTE-A system, multi-user diversity using Multi-User MIMO (MU-MIMO) is additionally obtained. Since interference between UEs multiplexed in an antenna domain exists in the MU-MIMO scheme, CSI accuracy may greatly affect not only interference of a UE that has reported CSI but also interference of other multiplexed UEs. Hence, in order to correctly perform MU-MIMO operation, it is necessary to report CSI having accuracy higher than that of a Single User-MIMO (SU-MIMO) scheme.

Accordingly, LTE-A standard has determined that a final PMI should be separately designed into W1, which a long-term and/or wideband PMI, and W2, which is a short-term and/or subband PMI.

An example of a hierarchical codebook transform scheme configuring one final PMI from among W1 and W2 may use a long-term covariance matrix of a channel as indicated in Equation 8:

W=norm(W1W2)   [Equation 8]

In Equation 8, W2 of a short-term PMI indicates a codeword of a codebook configured to reflect short-term channel information, W denotes a codeword of a final codebook, and norm(A) indicates a matrix in which a norm of each column of a matrix A is normalized to 1.

The detailed configurations of W1 and W2 are shown in Equation 9:

$\begin{matrix} {{{{W\; 1(i)} = \begin{bmatrix} X_{i} & 0 \\ 0 & X_{i} \end{bmatrix}},{where}}{{{X_{i}\mspace{14mu} {is}\mspace{14mu} {{Nt}/2}\mspace{14mu} {by}\mspace{14mu} M\mspace{14mu} {{matrix}.W}\; 2(j)} = {\overset{\overset{r\mspace{14mu} {columns}}{}}{\begin{bmatrix} e_{M}^{k} & e_{M}^{l} & e_{M}^{m} \\ {\alpha_{j}e_{M}^{k}} & {\beta_{j}e_{M}^{l}} & {{\ldots \gamma}_{j}e_{M}^{m}} \end{bmatrix}\;}\left( {{{if}\mspace{14mu} {rank}} = r} \right)}},{where}}{{1 \leq k},l,{m \leq M}}{and}{k,l,{m\mspace{14mu} {are}\mspace{14mu} {{integer}.}}}} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack \end{matrix}$

where Nt is the number of Tx antennas, M is the number of columns of a matrix Xi, indicating that the matrix Xi includes a total of M candidate column vectors. eMk, eMl, and eMm denote k-th, 1-th, and m-th column vectors of the matrix Xi in which only k-th, 1-th, and m-th elements among M elements are 0 and the other elements are 0, respectively. α_(j), β_(j), and y_(j) are complex values each having a unit norm and indicate that, when the k-th, 1-th, and m-th column vectors of the matrix Xi are selected, phase rotation is applied to the column vectors. At this time, i is an integer greater than 0, denoting a PMI index indicating W1 and j is an integer greater than 0, denoting a PMI index indicating W2.

In Equation 9, the codebook configurations are designed to reflect channel correlation properties generated when cross polarized antennas are used and when a space between antennas is dense, for example, when a distance between adjacent antennas is less than a half of signal wavelength. The cross polarized antennas may be categorized into a horizontal antenna group and a vertical antenna group. Each antenna group has the characteristic of a Uniform Linear Array (ULA) antenna and the two groups are co-located.

Accordingly, a correlation between antennas of each group has characteristics of the same linear phase increment and a correlation between antenna groups has characteristics of phase rotation. Consequently, since a codebook is a value obtained by quantizing a channel, it is necessary to design a codebook such that characteristics of a channel are reflected. For convenience of description, a rank-1 codeword generated by the aforementioned configurations is shown as follows:

$\begin{matrix} {{W\; 1(i)*W\; 2(j)} = \begin{bmatrix} {X_{i}(k)} \\ {\alpha_{j}{X_{i}(k)}} \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 10} \right\rbrack \end{matrix}$

In Equation 10, a codeword is expressed as a vector of N_(T)×1 (where NT is the number of Tx antennas) and is structured with an upper vector X_(i)(k) and a lower vector α_(j)X_(i)(k) which show correlation characteristics of a horizontal antenna group and a vertical antenna group, respectively. X_(i)(k) is preferably expressed as a vector having the characteristics of linear phase increment by reflecting the characteristics of a correlation between antennas of each antenna group and may be a DFT matrix as a representative example.

As described above, CSI in the LTE system includes, but is not limited to, CQI, PMI, and RI. According to transmission mode of each UE, all or some of the CQI, PMI, and RI is transmitted. Periodic transmission of CSI is referred to as periodic reporting and transmission of CSI at the request of an eNB is referred to as aperiodic reporting. In aperiodic reporting, a request bit included in uplink scheduling information transmitted by the eNB is transmitted to the UE. Then, the UE transmits CSI considering transmission mode thereof to the eNB through an uplink data channel (PUSCH). In periodic reporting, a period of CSI and an offset at the period are signaled in the unit of subframes by a semi-static scheme through a higher-layer signal per UE. The UE transmits CSI considering transmission mode to the eNB through an uplink control channel (PUCCH). If there is uplink data in a subframe in which CSI is transmitted, the CSI is transmitted through an uplink data channel (PUSCH) together with the uplink data. The eNB transmits transmission timing information suitable for each UE to the UE in consideration of a channel state of each UE and a UE distributed situation in a cell. The transmission timing information includes a period and an offset necessary for transmitting CSI and may be transmitted to each UE through an RRC message.

FIGS. 8 to 11 illustrate periodic reporting of CSI in an LTE system.

Referring to FIG. 8, there are four CQI reporting modes in the LTE system. Specifically, the CQI reporting modes may be divided into modes in a WideBand (WB) CQI and modes in a SubB and (SB) CQI according to CQI feedback type. The CQI reporting mode may also be divided into modes in a No PMI and modes in a single PMI depending on whether a PMI is transmitted or not. Each UE is informed of information comprised of a period and an offset through RRC signaling in order to periodically report CQI.

FIG. 9 illustrates an example of transmitting CSI when a UE receives information indicating {a period ‘5’ and an offset ‘1’} through signaling. Referring to FIG. 9, upon receiving the information indicating the period ‘5’ and offset ‘1’, the UE transmits CSI in the unit of 5 subframes with an offset of one subframe in ascending order of a subframe index counted from 0 starting from the first subframe. Although the CSI is transmitted basically through a PUCCH, if a PUSCH for data transmission is present at the same transmission time point, the CSI is transmitted through the PUSCH together with data. The subframe index is given as a combination of a system frame number (or a radio frame index) of and a slot index ns (0 to 19). Since one subframe includes two slots, the subframe index may be defined as 10×nf+floor(ns/2) wherein floor( ) indicates the floor function.

CQI transmission types include a type of transmitting a WB CQI only and a type of transmitting both a WB CQI and an SB CQI. In the type of transmitting a WB CQI only, CQI information for all bands is transmitted in subframes corresponding to every CQI transmission period. Meanwhile, in the case in which PMI information should also be transmitted according to the PMI feedback type as illustrated in FIG. 8, the PMI information is transmitted together with the CQI information. In the type of transmitting both a WB CQI and an SB CQI, the WB CQI and SB CQI are alternately transmitted.

FIG. 10 illustrates a system in which a system bandwidth consists of 16 RBs. It is assumed that the system bandwidth includes two Bandwidth Parts (BPs) BP0 and BP1 each consisting of two SubBands (SBs) SB0 and SB1 and each SB includes 4 RBs. The above assumption is exemplary and the number of BPs and the size of each SB may vary with the size of the system bandwidth. The number of SBs constituting each BP may differ according to the number of RBs, the number of BPs, and the size of each SB.

In the CQI transmission type of transmitting both a WB CQI and an SB CQI, the WB CQI is transmitted in the first CQI transmission subframe and an SB CQI of the better SB state of SB0 and SB1 in BP0 is transmitted in the next CQI transmission subframe together with and an index of the corresponding SB (e.g. Subband Selection Indicator (SSI). Thereafter, an SB CQI of the better SB state of SB0 and SB1 in BP1 and an index of the corresponding SB are transmitted in the next CQI transmission subframe. Thus, CQI of each BP is sequentially transmitted after transmission of the WB CQI. The CQI of each BP may be sequentially transmitted once to four times during the interval between transmission intervals of two WB CQIs. For example, if the CQI of each BP is transmitted once during the time interval between two WB CQIs, CQIs may be transmitted in the order of WB CQI

BP0 CQI

BP1 CQI

WB CQI. If the CQI of each BP is transmitted four times during the time interval between two WB CQIs, CQIs may be transmitted in the order of WB CQI

BP0 CQI

BP1 CQI

BP0 CQI

BP1 CQI

BP0 CQI

BP1 CQI

BP0 CQI

BP1 CQI

WB CQI. Information as to how many times each BP CQI is transmitted is signaled by a higher layer (RRC layer).

FIG. 11(a) illustrates an example of transmitting both a WB CQI and an SB CQI when a UE receives information indicating {period ‘5’ and offset ‘1’} through signaling. Referring to FIG. 11(a), a CQI may be transmitted only in subframes corresponding to the signaled period and offset regardless of type. FIG. 11(b) illustrates an example of transmitting an RI in addition to the example shown in FIG. 11(a). The RI may be signaled as a combination of a multiple of a WB CQI transmission period and an offset at the transmission period from a higher layer (e.g. RRC layer). The offset of the RI is signaled using a value relative to the offset of a CQI. For example, if the offset of the CQI is ‘1’ and the offset of the RI is ‘0’, the RI has the same offset as the CQI. The offset value of the RI is defined as 0 or a negative number. More specifically, it is assumed in FIG. 11(b) that, in an environment identical to that of FIG. 11(a), an RI transmission period is a multiple of 1 of the WB CQI transmission period and the RI offset is ‘−1’. Since the RS transmission period is a multiple of 1 of the WB CQI transmission period, the RS transmission period and the WB CQI transmission period are substantially the same. Since the offset of the RI is ‘−1’, the RI is transmitted based upon the value ‘-1’ (i.e. subframe index 0) relative to the offset ‘1’ of the CQI in FIG. 11(a). If the offset of the RI is ‘0’, the transmission subframes of the WB CQI and RI overlap. In this case, the WB CQI is dropped and the RI is transmitted.

FIG. 12 illustrates CSI feedback in the case of Mode 1-1 of FIG. 8.

Referring to FIG. 12, CSI feedback is comprised of two types of report content, i.e. transmission of Report 1 and transmission of Report 2. More specifically, an RI is transmitted through Report 1 and a WB PMI and a WB CQI are transmitted through Report 2. Report 2 is transmitted in subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI)mod(Npd)=0. Noffset,CQI indicates an offset for PMI/CQI transmission shown in FIG. 9. In FIG. 12, Noffset,CQI=1. Npd illustrates an interval of subframes between contiguous Reports 2 and the case of Npd =2 is illustrated in FIG. 12. Report 1 is transmitted in subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI−Noffset,RI)mod(MRI*Npd)=0. MRI is determined by higher layer signaling. Noffset,RI denotes a relative offset value for RI transmission shown in FIG. 11. The case in which MRI=4 and Noffset,RI=−1 is illustrated in FIG. 12.

FIG. 13 illustrates CSI feedback in the case of Mode 2-1 of FIG. 8.

Referring to FIG. 13, CSI feedback is comprised of three types of report content, i.e. transmission of Report 1, transmission of Report 2, and transmission of Report 3. More specifically, an RI is transmitted through Report 1, a WB PMI and a WB CQI are transmitted through Report 2, and an SB CQI and an L-bit Subband Selection Indicator (SSI) are transmitted through Report 3. Report 2 or Report 3 is transmitted in subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI)mod(Npd)=0. Especially, Report 2 is transmitted in subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI)mod(H*Npd)=0. Accordingly, Report 2 is transmitted at an interval of H*Npd and subframes between contiguous Reports are filled with transmission of Report 3. At this time, H equals to J*K+1 wherein J is the number of BPs. K is a value indicating how many full cycles will be consecutively performed, wherein the full cycle is a cycle during which a process for selectively transmitting a subband once per different BP over all BPs. K is determined by higher layer signaling. The case in which Npd=2, J=3, and K=1 is illustrated in FIG. 13. Report 1 is transmitted in subframe indexes satisfying (10*nf+floor(ns/2)−Noff,CQI−Noffset,RI)mod(MRI*(J*K+1)*Npd)=0. The case in which MRI=2 and Noffset,RI=−1 is illustrated in FIG. 13.

FIG. 14 illustrates periodic reporting of CSI which is being discussed in LTE-A. If an eNB includes 8 Tx antennas in Mode 2-1, then a 1-bit indicator, i.e. a Precoder Type Indication (PTI) parameter, is configured and periodic reporting modes classified into two types according to the PTI value are considered. In FIGS. 14, W1 and W2 illustrate hierarchical codebooks described with reference to Equations 8 and 9. If both W1 and W2 are determined, a completed type of a precoding matrix W is determined by combining W1 and W2.

Referring to FIG. 14, in the case of periodic reporting, different contents corresponding to Report 1, Report 2, and Report 3 are reported according to different repetition periods. An RI and a 1-bit PTI value are reported through Report 1. A WB W1 (when PTI=0) or a WB W2 and a WB CQI (when PTI=1) are reported through Report 2. A WB W2 and a WB CQI (when PTI=0) or an SB W2 and an SB CQI (when PTI=1) are reported through Report 3.

Report 2 and Report 3 are transmitted in subframes (for convenience, referred to as a first subframe set) having subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI) mod (NC)=0 wherein Noffset,CQI is an offset value for PMI/CQI transmission shown in FIG. 9 and Nc denotes a subframe interval between contiguous Reports 2 or Reports 3. The case in which Noffset,CQI=1 and Nc=2 is illustrated in FIG. 14. The first subframe set is comprised of subframes having odd-numbered indexes. of denotes a system frame number (or radio frame index) and ns denotes a slot index in a radio frame. floor( ) indicates the floor function and ‘A mod B’ indicates a remainder obtained by dividing A by B.

Report 2 is located in some subframes in the first subframe set and Report 3 is located in the other subframes. More specifically, Report 2 is located in subframes having subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI) mod (H*Nc)=0. Accordingly, Report 2 is transmitted at an interval of H*Nc and one or more first subframes between contiguous Reports 2 are filled with transmission of Report 3. If PTI=0, then H=M and M is determined by higher layer signaling. The case in which M=2 is illustrated in FIG. 14. If PTI=1, then H=J*K+1, K is determined by higher layer signaling, and J is the number of BPs. In FIGS. 14, J=3 and K=1.

Report 1 is transmitted in subframes having subframe indexes satisfying (10*nf+floor(ns/2)−Noffset,CQI-Noffset,RI) mod (MRI*(J*K+1)*Nc)=0 wherein MRI is determined by higher layer signaling. Noffset,RI indicates a relative offset value for an RI. In FIG. 14, MRI=2 and Noffset,RI=−1. The transmission time points of Report 1 and Report 2 do not overlap because Noffset,RI=−1. When a UE calculates RI, W1, and W2, they are associated with each other. For example, W1 and W2 are calculated depending on RI and W2 is calculated depending on W1. A BS may be aware of a final W from W1 and W2 when both Report 2 and Report 3 are reported after Report 1 is reported.

8 Tx (Transmit Antenna) Codebook

A communication system such as LTE-A further applies multi-user diversity technology using multi-user MIMO (MU-MIMO). To this end, from a feedback point of view, more enhanced accuracy is required than before. This is because there is an interference channel between UEs that are multiplexed in an antenna domain of MU-MIMO, and thus the accuracy of a feedback channel largely affects another multiplexed UE as well as a UE that transmits feedback. Accordingly, in order to enhance feedback channel accuracy in LTE-A, a PMI of a 8Tx codebook may be designed to be divided into W⁽¹⁾ that is a long term and/or wideband precoder and W⁽²⁾ that is a short term and/or sub-band precoder.

An equation for one final PMI from two-channel information is represented by multiplication of W⁽¹⁾ and W⁽²⁾ as follows.

W=norm(W ⁽¹⁾ W ⁽²⁾)   [Equation 11]

In [Equation 11] above, W is a precoder generated from W⁽¹⁾ and W⁽²⁾, and UE feedbacks the information to a BS. norm(A) refers to a matrix with a norm normalized to 1 for each column of matrix A.

Detailed configurations of W⁽¹⁾ and W⁽²⁾ in a 8Tx codebook defined in LTE are represented as follows.

$\begin{matrix} {\mspace{79mu} {{{{W\; 1(i)} = \begin{bmatrix} X_{i} & 0 \\ 0 & X_{i} \end{bmatrix}},\mspace{79mu} {where}}\mspace{79mu} {{{X_{i}\mspace{14mu} {is}\mspace{14mu} {{Nt}/2}\mspace{14mu} {by}\mspace{14mu} M\mspace{14mu} {{matrix}.W}\; 2(j)} = {\overset{\overset{r\mspace{14mu} {columns}}{}}{\begin{bmatrix} e_{M}^{k} & e_{M}^{l} & e_{M}^{m} \\ {\alpha_{j}e_{M}^{k}} & {\beta_{j}e_{M}^{l}} & {{\ldots \gamma}_{j}e_{M}^{m}} \end{bmatrix}\;}\left( {{{if}\mspace{14mu} {rank}} = r} \right)}},\mspace{79mu} {where}}\mspace{79mu} {{1 \leq k},l,{m \leq M}}\mspace{85mu} {and}\mspace{79mu} {k,l,{m\mspace{14mu} {are}\mspace{14mu} {{integer}.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 12} \right\rbrack \end{matrix}$

The codewords are designed so as to reflect correlation characteristics between established channels, if cross polarized antennas are arranged densely, for example, the distance between adjacent antennas is equal to or less than a half of a signal wavelength. The cross polarized antennas may be divided into a horizontal antenna group and a vertical antenna group and the two antenna groups are co-located, each having the property of a uniform linear array (ULA) antenna. Therefore, the correlations between antennas in each group have the same linear phase increment (LPI and LPI) property and the correlation between the antenna groups is characterized by phase rotation.

Since a codebook is eventually quantized values of channels, it is necessary to design a codebook, reflecting channel characteristics corresponding to a source. For example, a rank 1 codeword satisfying [Equation 13] may reflect the aforementioned characteristics.

$\begin{matrix} {{W\; 1(i)*W\; 2(j)} = \begin{bmatrix} {X_{i}(k)} \\ {\alpha_{j}{X_{i}(k)}} \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 13} \right\rbrack \end{matrix}$

In [Equation 13], a codeword is expressed as an Nt×1 (N_(T) is the number of Tx antennas) and the codeword is composed of an upper vector X_(j)(k) and a lower vector α_(j)X_(i)(k), representing the correlation characteristics of the horizontal and vertical antenna groups, respectively. X_(i)(k) is expressed as a vector having the linear phase increment property, reflecting the correlation characteristics between antennas in each antenna group. For example, a Discrete Fourier Transform (DFT) matrix may be used for X_(i)(k).

4 Tx Dual Codebook Downscaled from 8 Tx Codebook

In an LTE Rel-10 system, an 8 Tx codebook for a BS having 8 Tx antennas is defined. The above codebook is a dual codebook structure in which two codebooks are multiplied and includes W⁽¹⁾ codebook including wideband/longterm channel information and W⁽²⁾ codebook including subband/shorter channel information. Recently, a codebook similar to the 8Tx codebook defined in the LTE Rel-10 system was proposed as one of 4Tx codebook. The proposed codebook is as follows.

The overall precoder is formed as the product of W⁽¹⁾ and W⁽²⁾ according to [Equation 14] below.

W=W⁽¹⁾W⁽²⁾   [Equation 14]

The inner precoder W⁽¹⁾ is then selected from a first codebook C⁽¹⁾ according to [Equation 15] below.

[Equation  15] ${C^{\prime {(1)}} = \begin{Bmatrix} {\begin{bmatrix} {\overset{\sim}{W}}^{(1)} & 0 \\ 0 & {\overset{\sim}{W}}^{(1)} \end{bmatrix}} \\ {{{\overset{\sim}{W}}^{(1)}\begin{bmatrix} w_{2k\; {mod}\; 16} & w_{{({{2k} + 1})}{mod}\; 16} & w_{{({{2k} + 2})}{mod}\; 16} & w_{{({{2k} + 3})}{mod}\; 16} \end{bmatrix}},} \\ {{k = 0},1,\ldots \mspace{14mu},7} \end{Bmatrix}}\mspace{20mu} {where}\mspace{20mu} {{w_{n} = \begin{bmatrix} 1 \\ e^{j\frac{2\pi \; n}{16}} \end{bmatrix}},\mspace{20mu} {n = 0},1,\ldots \mspace{14mu},15}$

The outer precoder W⁽²⁾ for rank 1 transmission is selected from a second codebook C₁ ⁽²⁾ according to [Equation 16] below.

$\begin{matrix} {{C_{1}^{(2)} = \left\{ {\begin{bmatrix} Y \\ {a_{1}Y} \end{bmatrix},\begin{bmatrix} Y \\ {{- a_{1}}Y} \end{bmatrix},\begin{bmatrix} Y \\ {{ja}_{1}Y} \end{bmatrix},\begin{bmatrix} Y \\ {{- {ja}_{1}}Y} \end{bmatrix}} \right\}}{Y \in \left\{ {e_{1},e_{2},e_{3},e_{4}} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 16} \right\rbrack \end{matrix}$

Here, e_(n) is a selection vector with all zeros except for an n^(th) element where n is 1 to 4. In addition, a_(n)=e^(jφ) ^(n) is satisfied and φ_(n) is a phase value determined by a codeword index of C⁽¹⁾ and C₁ ⁽²⁾ and is responsible for compensation such that

$\begin{bmatrix} Y \\ {a_{1}Y} \end{bmatrix}\quad$

has LPI property.

An outer precoder W⁽²⁾ or rank 2 transmission is selected from the second codebook C₂ ⁽²⁾.

$\begin{matrix} {{C_{2}^{(2)} = \left\{ {\begin{bmatrix} Y_{1} & Y_{2} \\ {a_{1}Y_{1}} & {{- a_{2}}Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {{ja}_{1}Y_{1}} & {{- {ja}_{2}}Y_{2}} \end{bmatrix}} \right\}}{\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1},e_{1}} \right),\left( {e_{2},e_{2}} \right),\left( {e_{3},e_{3}} \right),\left( {e_{4},e_{4}} \right),\left( {e_{1},e_{2}} \right),\left( {e_{2},e_{3}} \right),\left( {e_{1},e_{4}} \right),\left( {e_{2},e_{4}} \right)} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 17} \right\rbrack \end{matrix}$

Here, e_(n) is a 4-element selection vector with all zeros except the n^(th) element. In addition, a_(n)=e^(jφ) ^(n) is satisfied and φ_(n) is a phase value determined by a codeword index of C⁽¹⁾ and C₂ ⁽²⁾ and is responsible for compensation such that each vector of

$\begin{bmatrix} Y_{1} & Y_{2} \\ {a_{1}Y_{1}} & {{- a_{2}}Y_{2}} \end{bmatrix}\quad$

has LPI property.

The rank 1 codeword of the 4Tx codebook is generated as follows. A 2×2 DFT matrix is oversampled eightfold to generate a 2×16 DFT matrix. When one of 16 vectors is selected and the selected 2×1 vector is v, v repeatedly concatenates to generate a 4×1 vector of [v v]^(T). In consideration of four phase compensation values {1, j, −1, −j} for phase compensation of a vertical antenna group and a horizontal antenna group of X-pol antennas, one of {[v a₁v]^(T), [v a₁*j*v]^(T), [v −a₁*j*v]^(T)} is selected. If compensation is not performed using a₁, only eight vectors among a total of 64 rank 1 vectors have LPI property. The lower vector is multiplied by al to perform compensation such that codeword of [v a₁v]^(T) always has LPI property. As a result, 16 vectors among a total of 64 rank 1 vectors have LPI property. a₁ is determined by a function of codewords of C⁽¹⁾ and C₂ ⁽²⁾.

Channel Property of ULA Antenna

The channel property of the ULA antenna may be expressed by the property of a dominant eigen vector of a channel. In general, in a correlated environment in which a gap between ULA antenna ports is narrow, the dominant eigen vector has LPI property. Since transmit antenna ports are separated at the same interval, the signal of each port has regular reception delay. That is, there is a reception time difference of Δi between a signal received from a first transmit antenna and a signal received from an i^(th) transmit antenna. The reception time difference appears as a phase change of a channel such that there is a phase difference of τi between the signal received from the first transmit antenna and the signal received from the i^(th) transmit antenna and the channel indicates LPI property. Accordingly, in a codebook optimized in the correlated environment in which the gap between ULA antenna ports is narrow, each codeword needs to have LPI property.

4 Tx Codebook of Rank 2

The aforementioned 4Tx codebook includes a first codebook C⁽¹⁾ having a size of 3 bits and a second codebook C⁽²⁾ having a size of 4 bits at each ran and thus has a size of a total of 7 bits (here, the second codebook is defined to be divided into C₁ ⁽²⁾ and C₂ ⁽²⁾ according to rank but, for convenience of description, the second codebook is C⁽²⁾ irrespective of rank). Some of rank 1 codewords generated as the codebook have the LPI property in consideration of the ULA antenna. However, a codeword having LPI property is not present in both first and second columns among the rank 2 codewords generated as the codebook.

Accordingly, in rank 2 or more, the codebook is requested such that all beam vectors have LPI properties in order to improve a codebook performance in a high correlated ULA antenna. In addition, in order to minimize inter-stream interference, it is necessary to generate the codebook such that the beam vectors are orthonomal to each other. Hereinafter, a codebook having the following two properties in rank 2 or more will be proposed. First, all beam vectors have LPI property. Second, all beam vectors need to be orthonomal to each other.

The present invention proposes a codeword in which all beam vectors have LPI property and orthonomal property in rank 2 or more and proposes a codebook having a codeword having such a property. The 4 Tx codebook of rank 2 includes only codewords having the above properties or codewords having the above properties.

The rank 2 codeword generated based on Equations 14 to 18 is represented according to [Equation 18] below

$\begin{matrix} {\left\lbrack \underset{\_}{\begin{matrix} w_{n} & w_{m} \\ {a_{1}w_{n}} & {{- a_{2}}w_{m}} \end{matrix}} \right\rbrack,{{or}\left\lbrack \underset{\_}{\begin{matrix} w_{n} & w_{m} \\ {{ja}_{1}w_{n}} & {{- {ja}_{2}}w_{m}} \end{matrix}} \right\rbrack}} & \left\lbrack {{Equation}\mspace{14mu} 18} \right\rbrack \end{matrix}$

Here, n and m refer to arbitrary DFT vector indices selected via C₂ ⁽²⁾ and each of Wn and Wm refer one vector selected from the oversampled DFT vector

${w_{k} = \begin{bmatrix} 1 \\ e^{j\frac{2\pi \; k}{16}} \end{bmatrix}},{k = 0},1,\ldots \mspace{14mu},15.$

A condition of the following equation needs to be satisfied such that all beam vectors of the rank 2 codeword of [Equation 18] have orthonomal property.

w _(n) ^(H) w _(m) −a ₁ ^(H) a ₂ w _(n) ^(H) w _(m)=0   [Equation 19]

In order to satisfy the above equation, a₁=a₂ or w_(n) ^(H)w_(m)=0 needs to be satisfied.

When the condition a₁=a₂ is satisfied such that all beam vectors have orthonomal property, a condition required to satisfy LPI property will now be described.

Under the assumption of a₁=a₂=e^(jφ), [Equation 18] is summarized according to [Equation 20] below.

$\begin{matrix} {\begin{bmatrix} 1 & 1 \\ e^{j\frac{2\pi}{16}{(n)}} & e^{j\frac{2\pi}{16}{(m)}} \\ e^{j\; \varphi} & {- e^{j\; \varphi}} \\ e^{j{({\frac{2\pi}{16}{({n + \varphi})}})}} & {- e^{j{({\frac{2\pi}{16}{({m + \varphi})}})}}} \end{bmatrix},{{or}\begin{bmatrix} 1 & 1 \\ e^{j\frac{2\pi}{16}{(n)}} & e^{j\frac{2\pi}{16}{(m)}} \\ {je}^{j\; \varphi} & {- {je}^{j\; \varphi}} \\ {je}^{j{({\frac{2\pi}{16}{({n + \varphi})}})}} & {- {je}^{j{({\frac{2\pi}{16}{({m + \varphi})}})}}} \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 20} \right\rbrack \end{matrix}$

As shown in the left of [Equation 20] above, [Equation 21] needs to be satisfied such that both two vectors have LPI property.

$\begin{matrix} {\varphi = {{2\frac{2\pi}{16}(n)} = {{2\frac{2\pi}{16}(m)} + {\pi \pm {2\pi}}}}} & \left\lbrack {{Equation}\mspace{14mu} 21} \right\rbrack \end{matrix}$

m and n that satisfy [Equation 21] above satisfy n=m±4.

However, if the existing codebook of [Equation 15] above is used, since |n−m|<4, it is impossible to generate a codeword having both orthonomal property and LPI property. Accordingly, in order to enable two vectors configuring the rank 2 codeword to have the LPI property, C⁽¹⁾ and C₂ ⁽²⁾ need to be newly designed in the 4Tx codebook.

According to a first example of the 4 Tx codebook of rank 2, [Equation 21] above is satisfied such that all vectors have LPI property and orthonomal property is satisfied according to a₁=a₂ among conditions based on [Equation 19] above.

C⁽¹⁾ and C₂ ⁽²⁾ according to the first example of the 4 Tx codebook of rank 2 are configured according to [Equation 22] below.

$\begin{matrix} {C^{(1)} = \begin{Bmatrix} {{\begin{bmatrix} {\overset{\sim}{W}}^{(1)} & 0 \\ 0 & {\overset{\sim}{W}}^{(1)} \end{bmatrix}{\overset{\sim}{W}}^{(1)}} = \begin{bmatrix} w_{4{kmod}\; 16} & w_{\begin{matrix} {({{4k} + 1})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 2})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 3})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 4})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 2})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 5})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 6})} \\ {{mod}\; 16} \end{matrix}} & w_{\begin{matrix} {({{4k} + 7})} \\ {{mod}\; 16} \end{matrix}} \end{bmatrix}} \\ {\quad{{k = 0},1,2,3}} \end{Bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack \end{matrix}$

The inner precoder W⁽¹⁾ is selected from the first codebook C⁽¹⁾.

Here,

${w_{n} = \begin{bmatrix} 1 \\ e^{j\frac{2\pi \; n}{16}} \end{bmatrix}},{n = 0},1,\ldots \mspace{14mu},15$

is satisfied and k is a codeword index of C⁽¹⁾. In addition, C⁽¹⁾ (k) is a k^(th) codeword of the codebook C⁽¹⁾.

The outer precoder W⁽²⁾ for rank 2 transmission is selected from the second codebook C₂ ⁽²⁾ of [Equation 23] below.

$\begin{matrix} {\mspace{79mu} {{C_{2}^{(2)} = \left\{ {\begin{bmatrix} Y_{1} & Y_{2} \\ {a_{1}Y_{1}} & {{- a_{2}}Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {{ja}_{1}Y_{1}} & {{- {ja}_{2}}Y_{2}} \end{bmatrix}} \right\}}\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1},e_{5}} \right),\left( {e_{2},e_{6}} \right),\left( {e_{3},e_{7}} \right),\left( {e_{4},e_{8}} \right)} \right\}}{C_{2}^{(2)} = \left\{ {\begin{bmatrix} e_{1} & e_{5} \\ {a_{1}e_{1}} & {{- a_{2}}e_{5}} \end{bmatrix},\begin{bmatrix} e_{2} & e_{6} \\ {a_{1}e_{2}} & {{- a_{2}}e_{6}} \end{bmatrix},\begin{bmatrix} e_{3} & e_{7} \\ {a_{1}e_{3}} & {{- a_{2}}e_{7}} \end{bmatrix},{\quad{\begin{bmatrix} e_{4} & e_{8} \\ {a_{1}e_{4}} & {{- a_{2}}e_{8}} \end{bmatrix},\begin{bmatrix} e_{1} & e_{5} \\ {{ja}_{1}e_{1}} & {{- {ja}_{2}}e_{5}} \end{bmatrix},\begin{bmatrix} e_{2} & e_{6} \\ {{ja}_{1}e_{2}} & {{- {ja}_{2}}e_{6}} \end{bmatrix},\begin{bmatrix} e_{3} & e_{7} \\ {{ja}_{1}e_{3}} & {{- {ja}_{2}}e_{7}} \end{bmatrix},\begin{bmatrix} e_{4} & e_{8} \\ {{ja}_{1}e_{4}} & {{- {ja}_{2}}e_{8}} \end{bmatrix}}}} \right.}}} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack \end{matrix}$

Here, e_(n) a 4-element selection vector with all zeros except the nth element. l is the codeword index of C₂ ⁽²⁾ and l=0, 1, 2, . . . , 7. In addition, C₂ ⁽²⁾ (l) is an l^(th) codeword of the codebook C₂ ⁽²⁾

$a_{1} = {a_{2} = e^{2{j{({\frac{2\pi}{16}{({{4k} + {l\; {mod}\; 4}})}{mod}\; 16})}}}}$

and is satisfied.

C⁽¹⁾ according to the first example of the 4 Tx codebook of rank 2 is generated using the same oversampled DFT vector like C⁽¹⁾ of [Equation 15] above.

However, distinguished from C⁽¹⁾ of [Equation 15] above, C⁽¹⁾ according to the first example of the 4 Tx codebook of rank 2 is composed of eight consecutive oversampled DFT vectors in order to enable two beam vectors configuring the rank 2 codeword to have the LPI property. Since C⁽¹⁾ of [Equation 15] above is composed of four consecutive oversampled DFT vectors, even if an arbitrary vector included in C⁽¹⁾ is selected using C⁽²⁾, the two beam vectors which are finally generated do not have the LPI property. That is, in [Equation 21] above, |m−n|=4 is not satisfied.

Accordingly, C⁽¹⁾ according to the first example of the 4 Tx codebook of rank 2 is composed of a fatter matrix and the type of the DFT vector selected from C⁽¹⁾ via C⁽²⁾ is increased. That is, in [Equation 21] above, since 0<|m−n|<7, it may be possible to find m and n that satisfy |m−n|=4. As a result, the finally generated two beam vectors have LPI attribute.

A codeword having LPI property may be generated using C⁽¹⁾ and C⁽²⁾ according to the first example of the 4 Tx codebook of rank 2. In C⁽²⁾, (Y₁, Y₂) is limited to (e_(i), e_(i+4)). As a result, in [Equation 21] above, |m−n|=4 is always satisfied. In addition, according to [Equation 21] for enabling all beam vector configuring rank 2 to have the orthonomal property and the LPI property, in C₂ ⁽²⁾ according to the first example of the 4 Tx codebook of rank 2, a₁=a₂=e^(jφ), where

$\varphi = {{2\frac{2\pi}{16}(n)} = {{2\frac{2\pi}{16}(m)} + {\pi \pm {2\pi}}}}$

is set.

According to a second example of the 4 Tx codebook of rank 2, [Equation 21] above is satisfied such that all vectors have LPI property and orthonomal property is satisfied according to a₁=a₂ among conditions based on [Equation 19] above.

C⁽¹⁾ and C₂ ⁽²⁾ according to the second example of the 4 Tx codebook of rank 2 are configured according to [Equation 24] below.

$\begin{matrix} {\mspace{619mu} {\left\lbrack {{Equation}\mspace{14mu} 24} \right\rbrack {C^{(1)} = \begin{Bmatrix} {\begin{bmatrix} {\overset{\sim}{W}}^{(1)} & 0 \\ 0 & {\overset{\sim}{W}}^{(1)} \end{bmatrix}} \\ {{{\overset{\sim}{W}}^{(1)} = \begin{bmatrix} w_{2{kmod}\; 8} & w_{{({{2k} + 1})}{mod}\; 8} & w_{{({{2k} + 2})}{mod}\; 8} & w_{{({{2k} + 3})}{mod}\; 8} \end{bmatrix}},} \\ {{k = 0},1,2,3} \end{Bmatrix}}}} & \; \end{matrix}$

The inner precoder W⁽¹⁾ is selected from the first codebook C⁽¹⁾.

Here,

${w_{n} = \begin{bmatrix} 1 \\ e^{j\frac{2\pi \; n}{16}} \end{bmatrix}},{n = 0},1,\ldots \mspace{14mu},15$

is satisfied and k is a codeword index of C⁽¹⁾. In addition, C⁽¹⁾(k) is a k^(th) codeword of the codebook C⁽¹⁾.

The outer precoder W⁽²⁾ for rank 2 transmission is selected from the second codebook C₂ ⁽²⁾ of [Equation 25] below.

$\begin{matrix} {\mspace{79mu} {{C_{2}^{(2)} = \left\{ {\begin{bmatrix} Y_{1} & Y_{2} \\ {a_{1}Y_{1}} & {{- a_{2}}Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {{ja}_{1}Y_{1}} & {{- {ja}_{2}}Y_{2}} \end{bmatrix}} \right\}}\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1},e_{3}} \right),\left( {e_{2},e_{4}} \right)} \right\}}{C_{2}^{(2)} = \left\{ {\begin{bmatrix} e_{1} & e_{3} \\ {a_{1}e_{1}} & {{- a_{2}}e_{3}} \end{bmatrix},\begin{bmatrix} e_{2} & e_{4} \\ {a_{1}e_{2}} & {{- a_{2}}e_{4}} \end{bmatrix},\begin{bmatrix} e_{1} & e_{3} \\ {{ja}_{1}e_{1}} & {{- {ja}_{2}}e_{3}} \end{bmatrix},\left. \quad\begin{bmatrix} e_{2} & e_{4} \\ {{ja}_{1}e_{2}} & {{- {ja}_{2}}e_{4}} \end{bmatrix} \right\}} \right.}}} & \left\lbrack {{Equation}\mspace{14mu} 25} \right\rbrack \end{matrix}$

Here, e_(n) is a 4-element selection vector with all zeros except the nth element. l is the codeword index of C₂ ⁽²⁾ and l=0, 1, 2, 3. In addition, C₂ ⁽²⁾(l) is an l^(th) codeword of the codebook C₂ ⁽²⁾

$a_{1} = {a_{2} = e^{2{j{({\frac{2\pi}{16}{({{4k} + {l\; {mod}\; 4}})}{mod}\; 16})}}}}$

and is satisfied.

C⁽¹⁾ according to the second example of the 4 Tx codebook of rank 2 is composed of a matrix having the same size as C⁽¹⁾ of [Equation 15] above.

However, distinguished from C⁽¹⁾ of [Equation 15] above, according to the second example of the 4 Tx codebook of rank 2 is composed of a DFT vector oversampled fourfold instead of eightfold in order to enable two beam vectors configuring the rank 2 codeword to have the LPI property. Since C⁽¹⁾ of [Equation 15] above is composed of a DFT vector oversampled eightfold, even if an arbitrary vector included in C⁽¹⁾ is selected using C⁽²⁾, the two beam vectors which are finally generated do not have the LPI property.

Accordingly, C⁽¹⁾ according to the second example of the 4 Tx codebook of rank 2 may be composed of a DFT vector oversampled fourfold and two beam vectors have LPI property via C⁽²⁾.

In the first example of the 4 Tx codebook of rank 2, C⁽²⁾ in order to enable the two beam vectors selected via C⁽²⁾ to have the LPI property, |m−n|=4 needs to be satisfied. However, the second example of the 4 Tx codebook of rank 2 corresponds to the case in which C⁽¹⁾ includes a DFT vector oversampled eightfold. Since C⁽¹⁾ according to the second example of the 4 Tx codebook of rank 2 is composed of a DFT vector oversampled fourfold, instead of |m−n|=4, |m−n|=2 needs to be satisfied. In order to satisfy this condition, (Y₁, Y₂)∈{(e₁, e₃), (e₂, e₄)} is set in [Equation 25] above. In addition, according to [Equation 21] for enabling all beam vectors configuring rank 2 to have the orthonomal property and the LPI property, C⁽¹⁾ according to the second example of the 4 Tx codebook of rank 2 is set according to a₁=a₂=e^(jφ), where

${\varphi = {2\frac{2\pi}{16}(n)}},{n = {\left( {{2k} + {l\mspace{14mu} {mod}{\mspace{11mu} \;}2}} \right){mod}\mspace{14mu} 8.}}$

According to a third example of the 4 Tx codebook of rank 2, [Equation 21] above is satisfied such that all vectors have LPI property and orthonomal property is satisfied according to v_(n) ^(H)v_(m)=0 among conditions based on [Equation 19] above.

In [Equation 19] above, when v_(n) ^(H)v_(m)=0 is satisfied, two beam vectors of rank 2 are always orthonomal with respect to arbitrary a₁a₂. Accordingly, a codebook is designed to satisfy v_(n) ^(H)v_(m)=0 and, when a₁, a₂ are calculated such that the beam vector corresponding to each rank has LPI property, a codebook having both orthonomal property and LPI property is generated.

The codebook according to the third example of the 4 Tx codebook of rank 2 is configured according to [Equation 26] below.

                                     [Equation  26] $C^{(1)} = \begin{Bmatrix} {\begin{bmatrix} {\overset{\sim}{W}}^{(1)} & 0 \\ 0 & {\overset{\sim}{W}}^{(1)} \end{bmatrix}} \\ {{{\overset{\sim}{W}}^{(1)} = \begin{bmatrix} w_{2{kmod}\; 8} & w_{{({{2k} + 1})}{mod}\; 8} & w_{{({{2k} + 2})}{mod}\; 8} & w_{{({{2k} + 3})}{mod}\; 8} \end{bmatrix}},} \\ {k = 0} \end{Bmatrix}$

The inner precoder W⁽¹⁾ is selected from the first codebook C⁽¹⁾.

Here,

${w_{n} = \begin{bmatrix} 1 \\ e^{j\frac{2\pi \; n}{16}} \end{bmatrix}},{n = 0},1,\ldots \mspace{14mu},15$

is satisfied and k is a codeword index of C⁽¹⁾. In addition, C⁽¹⁾ (k) is a k^(th) codeword of the codebook C⁽¹⁾.

The outer precoder W⁽²⁾ for rank 2 transmission is selected from the second codebook C₂ ⁽²⁾ according to [Equation 27] below.

$\begin{matrix} {{C_{2}^{(2)} = \left\{ {\begin{bmatrix} Y_{1} & Y_{2} \\ {a_{1}Y_{1}} & {{- a_{2}}Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {{ja}_{1}Y_{1}} & {{- {ja}_{2}}Y_{2}} \end{bmatrix}} \right\}}{\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1},e_{9}} \right),\left( {e_{2},e_{10}} \right),\left( {e_{3},e_{11}} \right),\left( {e_{4},e_{12}} \right),\left( {e_{5},e_{13}} \right),\left( {e_{6},e_{14}} \right),\left( {e_{7},e_{15}} \right),\left( {e_{8},e_{16}} \right)} \right\}}{C_{2}^{(2)} = \begin{Bmatrix} {\begin{bmatrix} e_{1} & a_{9} \\ {a_{1}e_{1}} & {{- a_{2}}e_{9}} \end{bmatrix},\begin{bmatrix} e_{2} & e_{10} \\ {a_{1}e_{2}} & {{- a_{2}}e_{10}} \end{bmatrix},\begin{bmatrix} e_{3} & e_{11} \\ {a_{1}e_{3}} & {{- a_{2}}e_{11}} \end{bmatrix},\begin{bmatrix} e_{4} & e_{12} \\ {a_{1}e_{4}} & {{- a_{2}}e_{12}} \end{bmatrix},\begin{bmatrix} e_{5} & e_{13} \\ {a_{1}e_{5}} & {{- a_{2}}e_{13}} \end{bmatrix},\begin{bmatrix} e_{6} & e_{14} \\ {a_{1}e_{6}} & {{- a_{2}}e_{14}} \end{bmatrix},} \\ {\begin{bmatrix} e_{7} & e_{15} \\ {a_{1}e_{7}} & {{- a_{2}}e_{15}} \end{bmatrix},\begin{bmatrix} e_{8} & e_{16} \\ {a_{1}e_{8}} & {{- a_{2}}e_{16}} \end{bmatrix},\begin{bmatrix} e_{1} & e_{9} \\ {{ja}_{1}e_{1}} & {{- {ja}_{2}}e_{9}} \end{bmatrix},\begin{bmatrix} e_{2} & e_{10} \\ {a_{1}e_{2}} & {{- {ja}_{2}}e_{10}} \end{bmatrix},\begin{bmatrix} e_{3} & e_{11} \\ {{ja}_{1}e_{3}} & {{- {ja}_{2}}e_{11}} \end{bmatrix},\begin{bmatrix} e_{4} & e_{12} \\ {{ja}_{1}e_{4}} & {{- {ja}_{2}}e_{12}} \end{bmatrix},} \\ {\begin{bmatrix} e_{5} & e_{13} \\ {{ja}_{1}e_{5}} & {{- {ja}_{2}}e_{13}} \end{bmatrix},\begin{bmatrix} e_{6} & e_{14} \\ {{ja}_{1}e_{6}} & {{- {ja}_{2}}e_{14}} \end{bmatrix},\begin{bmatrix} e_{7} & e_{15} \\ {{ja}_{1}e_{7}} & {{- {ja}_{2}}e_{15}} \end{bmatrix},\begin{bmatrix} e_{8} & e_{16} \\ {{ja}_{1}e_{8}} & {{- {ja}_{2}}e_{16}} \end{bmatrix}} \end{Bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 27} \right\rbrack \end{matrix}$

Here, e_(n) is a 4-element selection vector with all zeros except the nth element. l is the codeword index of C₂ ⁽²⁾ and l=0, 1, 2, . . . , 15 is satisfied. In addition, C₂ ⁽²⁾ (l) is an ith codeword of the codebook C₂ ⁽²⁾ and

${a_{1} = e^{2{j{({\frac{2\pi}{16}{({l\; {mod}\; 8})}})}}}},{a_{2} = e^{{2{j{({\frac{2\pi}{16}{({{({l\; {mod}\; 8})} + 8})}})}}} + {j\; \pi}}}$

is satisfied.

C⁽¹⁾ according to the third example of the 4 Tx codebook of rank 2 is composed of a DFT vector oversampled eightfold and has one codeword composed of all DFT vectors. v_(n) ^(H)v_(m)=0 in [Equation 19] is satisfied by restricting (Y₁, Y₂)={e_(i), e_(i+8)} of C₂ ⁽²⁾ according to the third example of the 4 Tx codebook of rank 2. That is, in the rank 2 codeword generated according to Equations 26 and 27, two beam vectors are orthonormal and a₁ and a₂ are set according to [Equation 27] above such that each beam vector has LPI property.

Although rank 2 is assumed in the aforementioned first to third examples of the 4 Tx codebook of rank 2, the scope of the present invention is not limited to rank 2 and includes an arbitrary codebook satisfying LPI property and orthonomal property using the aforementioned method at high rank such as rank 2 or more. In addition, the case in which some of the rank 2 codebook described in the aforementioned embodiments is subsampled or an arbitrary codebook including the codebook is included in the scope of the present invention.

Hereinafter, a case in which the aforementioned condition of the 4 Tx codebook of rank 2 is satisfied and the inner precoder W⁽¹⁾ and the outer precoder W⁽²⁾ are set to 4 bits and 1 bit, respectively will be described.

First, W⁽¹⁾ may be set according to [Equation 28] below.

$\begin{matrix} {{{W_{1}(l)} = \begin{bmatrix} {{\overset{\sim}{W}}_{1}(l)} & 0 \\ 0 & {{{\overset{\sim}{W}}_{1}(l)}{D_{a}(l)}} \end{bmatrix}},{l\; \in \left\{ {0,1,2,\ldots,15} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 28} \right\rbrack \end{matrix}$

Here, {tilde over (W)}₁(l) set according to [Equation 29] below.

$\begin{matrix} {{{{\overset{\sim}{W}}_{1}(l)} = \left\lbrack {w_{{(l)}{mod}\; 1\; 6}w_{{{({l + 1})}{mod}\; 16}\mspace{14mu}}\cdots \mspace{14mu} w_{{({l + 6})}{mod}\; 16}w_{{({l + 7})}{mod}\; 16}} \right\rbrack},{w_{n} = \left\lbrack e^{j\frac{\begin{matrix} 1 \\ {2\pi \; n} \end{matrix}}{16}} \right\rbrack}} & \left\lbrack {{Equation}\mspace{14mu} 29} \right\rbrack \end{matrix}$

In addition, according to [Equation 30] below, D_(a)(l) is composed of a p^(th) row and a q^(th) column, where p and q are started from 0.

$\begin{matrix} {\left\{ {D_{a}(l)} \right\}_{pq} = \left\{ \begin{matrix} {e^{{2 \cdot j}\frac{2{\pi \cdot {({{({l + {({p\mspace{14mu} {mod}\mspace{14mu} 4})}})}{mod}\mspace{14mu} 16})}}}{16}},{p = {q.}}} \\ {0,{p \neq q}} \end{matrix} \right.} & \left\lbrack {{Equation}\mspace{20mu} 30} \right\rbrack \end{matrix}$

W⁽²⁾ may be set according to the following equation.

${{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {3,7} \right)} \right\} \mspace{14mu} {or}}}$ ${{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {2,6} \right)} \right\}.}}$

Hereinafter, a case in which the aforementioned condition of the 4 Tx codebook of rank 2 is satisfied and the inner precoder W⁽¹⁾ and the outer precoder W⁽²⁾ are set to 3 bits and 2 bits, respectively will be described.

First, W⁽¹⁾ may be set according to [Equation 31] below.

$\begin{matrix} {{{W_{1}(l)} = \begin{bmatrix} {{\overset{\sim}{W}}_{1}(l)} & 0 \\ 0 & {{{\overset{\sim}{W}}_{1}(l)}{D_{a}(l)}} \end{bmatrix}},{l\; \in \left\{ {0,1,2,\ldots,7} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 31} \right\rbrack \end{matrix}$

Here, {tilde over (W)}₁(l) is set according to [Equation 32] below.

$\begin{matrix} {{{{\overset{\sim}{W}}_{1}(l)} = \left\lbrack {w_{{({2l})}{mod}\; 1\; 6}w_{{{({{2l} + 1})}{mod}\; 16}\mspace{14mu}}\cdots \mspace{14mu} w_{{({{2l} + 6})}{mod}\; 16}w_{{({{2l} + 7})}{mod}\; 16}} \right\rbrack},{w_{n} = \left\lbrack e^{j\frac{\begin{matrix} 1 \\ {2\pi \; n} \end{matrix}}{16}} \right\rbrack}} & \left\lbrack {{Equation}\mspace{14mu} 32} \right\rbrack \end{matrix}$

In addition, according to the following equation, D_(a)(l) is composed of a p^(th) row and a q^(th) column, where p and q are started from 0.

$\begin{matrix} {\left\{ {D_{a}(l)} \right\}_{pq} = \left\{ \begin{matrix} {e^{{2 \cdot j}\frac{2{\pi \cdot {({{({{2l} + {({p\mspace{14mu} {mod}\mspace{14mu} 4})}})}{mod}\mspace{14mu} 16})}}}{16}},{p = {q.}}} \\ {0,{p \neq q}} \end{matrix} \right.} & \left\lbrack {{Equation}\mspace{14mu} 33} \right\rbrack \end{matrix}$

W⁽²⁾ may be set according to the following equation.

${{{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {3,7} \right),\left( {4,8} \right)} \right\} \;.}}}\mspace{11mu}$

Hereinafter, a case in which the aforementioned condition of the 4 Tx codebook of rank 2 is satisfied and the inner precoder W⁽¹⁾ and the outer precoder W⁽²⁾ are set to 3 bits and 1 bit, respectively will be described.

First, W⁽¹⁾ may be set according to [Equation 34] below.

$\begin{matrix} {{{W_{1}(l)} = \begin{bmatrix} {{\overset{\sim}{W}}_{1}(l)} & 0 \\ 0 & {{{\overset{\sim}{W}}_{1}(l)}{D_{a}(l)}} \end{bmatrix}},{l\; \in \left\{ {0,1,2,\ldots,7} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 34} \right\rbrack \end{matrix}$

Here, {tilde over (W)}₁(l) is set according to [Equation 35] below.

$\begin{matrix} {{{{\overset{\sim}{W}}_{1}(l)} = \left\lbrack {w_{{({2l})}{mod}\; 1\; 6}w_{{{({{2l} + 1})}{mod}\; 16}\mspace{14mu}}\cdots \mspace{14mu} w_{{({{2l} + 6})}{mod}\; 16}w_{{({{2l} + 7})}{mod}\; 16}} \right\rbrack},{w_{n} = \left\lbrack e^{j\frac{\begin{matrix} 1 \\ {2\pi \; n} \end{matrix}}{16}} \right\rbrack}} & \left\lbrack {{Equation}\mspace{14mu} 35} \right\rbrack \end{matrix}$

In addition, according to [Equation 36] below, D_(a)(l) is composed of a p^(th) row and a q^(th) column, where p and q are started from 0.

$\begin{matrix} {\left\{ {D_{a}(l)} \right\}_{pq} = \left\{ \begin{matrix} {e^{{2 \cdot j}\frac{2{\pi \cdot {({{({{2l} + {({p\mspace{14mu} {mod}\mspace{14mu} 4})}})}{mod}\mspace{14mu} 16})}}}{16}},{p = {q.}}} \\ {0,{p \neq q}} \end{matrix} \right.} & \left\lbrack {{Equation}\mspace{14mu} 36} \right\rbrack \end{matrix}$

W⁽²⁾ may be set according to the following equation.

${{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {3,7} \right)} \right\} \mspace{14mu} {or}}}$ ${{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {2,6} \right)} \right\}.}}$

Hereinafter, a case in which the aforementioned condition of the 4 Tx codebook of rank 2 is satisfied and the inner precoder W⁽¹⁾ and the outer precoder W⁽²⁾ are set to 4 bits and 2 bits, respectively.

First, W⁽¹⁾ is set according to [Equation 37] below.

$\begin{matrix} {{{W_{1}(l)} = \begin{bmatrix} {{\overset{\sim}{W}}_{1}(l)} & 0 \\ 0 & {{{\overset{\sim}{W}}_{1}(l)}{D_{a}(l)}} \end{bmatrix}},{l\; \in \left\{ {0,1,2,\ldots,15} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 37} \right\rbrack \end{matrix}$

Here, {tilde over (W)}₁(l) set according to the following equation.

$\begin{matrix} {{{{\overset{\sim}{W}}_{1}(l)} = \left\lbrack {w_{{(l)}{mod}\; 1\; 6}w_{{{({l + 1})}{mod}\; 16}\mspace{14mu}}\cdots \mspace{14mu} w_{{({l + 6})}{mod}\; 16}w_{{({l + 7})}{mod}\; 16}} \right\rbrack},{w_{n} = \left\lbrack e^{j\frac{\begin{matrix} 1 \\ {2\pi \; n} \end{matrix}}{16}} \right\rbrack}} & \left\lbrack {{Equation}\mspace{14mu} 38} \right\rbrack \end{matrix}$

In addition, according to the following equation, D_(a)(l) is composed of a p^(th) row and a q^(th) column, where p and q are started from 0.

$\begin{matrix} {\left\{ {D_{a}(l)} \right\}_{pq} = \left\{ \begin{matrix} {e^{{2 \cdot j}\frac{2{\pi \cdot {({{({l + {({p\mspace{14mu} {mod}\mspace{14mu} 4})}})}{mod}\mspace{14mu} 16})}}}{16}},{p = {q.}}} \\ {0,{p \neq q}} \end{matrix} \right.} & \left\lbrack {{Equation}\mspace{14mu} 39} \right\rbrack \end{matrix}$

W⁽²⁾ may be set according to the following equation.

${{W_{2}\left( {n_{1},n_{2}} \right)} = \begin{bmatrix} e_{n_{1}} & e_{n_{2}} \\ e_{n_{1}} & {- e_{n_{2}}} \end{bmatrix}},{\left( {n_{1},n_{2}} \right) \in {\left\{ {\left( {1,5} \right),\left( {2,6} \right),\left( {3,7} \right),\left( {4,8} \right)} \right\}.}}$

4 Tx Codebook of Rank 3 or 4 According to the Present Invention

A codebook of rank 3 or 4 according to the present invention may be generated by sampling a 4 Tx codebook of LTE release 8 to reduce a codebook size. In general, in a high rank environment, system performance is not sensitive to a codebook size compared with a low rank. For example, when a receiving end is not an IRC receiver, performance is not affected in a max rank even if any precoder is used. For this reason, a LTE 8 Tx codebook may be designed to remarkably reduce a codebook size in a high rank, and in rank 8, a codebook size is 0 bit. In consideration of this principle, hereinafter, a new code book according to the present invention generated by sampling a LTE release-8 4 Tx codebook will be described. According to the present invention, a codebook size may be reduced to save feedback overhead.

The LTE release-8 4 Tx codebook may be configured by selecting rank n of column vectors in each matrix of the following equation using a predetermined method.

For example, when rank is 4, 4 Tx codebook is as follows.

First, each matrix for a BPSK modulation method of 4 TX codebook of rank 4 is as follows.

$\begin{matrix} {W_{0} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- 1} & {- 1} & 1 \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 40} \right\rbrack \\ {W_{2} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \end{bmatrix}}} & \; \\ {W_{8} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} \\ {- 1} & 1 & {- 1} & 1 \end{bmatrix}}} & \; \\ {W_{10} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & 1 \\ {- 1} & 1 & {- 1} & 1 \\ {- 1} & {- 1} & 1 & 1 \\ 1 & 1 & 1 & 1 \end{bmatrix}}} & \; \\ {W_{12} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & {- 1} \\ 1 & 1 & {- 1} & 1 \\ 1 & {- 1} & 1 & 1 \\ {- 1} & 1 & 1 & 1 \end{bmatrix}}} & \; \\ {W_{13} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & 1 \\ 1 & 1 & 1 & {- 1} \\ {- 1} & 1 & 1 & 1 \\ 1 & {- 1} & 1 & 1 \end{bmatrix}}} & \; \\ {W_{14} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & 1 \\ {- 1} & 1 & 1 & 1 \\ 1 & 1 & 1 & {- 1} \\ 1 & 1 & {- 1} & 1 \end{bmatrix}}} & \; \\ {W_{15} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} & {- 1} \\ {- 1} & {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & {- 1} & 1 \end{bmatrix}}} & \; \end{matrix}$

Next, each matrix for a QPSK modulation method of 4 TX codebook of rank 4 is as follows.

$\begin{matrix} {W_{1} = {\frac{1}{2}\begin{bmatrix} 1 & {- j} & {- 1} & j \\ j & 1 & j & 1 \\ {- 1} & {- j} & 1 & j \\ {- j} & 1 & {- j} & 1 \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 41} \right\rbrack \\ {W_{3} = {\frac{1}{2}\begin{bmatrix} 1 & j & {- 1} & {- j} \\ {- j} & 1 & {- j} & 1 \\ {- 1} & j & 1 & {- j} \\ j & 1 & j & 1 \end{bmatrix}}} & \; \\ {W_{9} = {\frac{1}{2}\begin{bmatrix} 1 & {- j} & 1 & {- j} \\ j & 1 & {- j} & {- 1} \\ 1 & j & 1 & j \\ j & {- 1} & {- j} & 1 \end{bmatrix}}} & \; \\ {W_{11} = {\frac{1}{2}\begin{bmatrix} 1 & j & 1 & j \\ {- j} & 1 & j & {- 1} \\ 1 & {- j} & 1 & {- j} \\ {- j} & {- 1} & j & 1 \end{bmatrix}}} & \; \end{matrix}$

In addition, signs of imaginary numbers of each matrix of Equation 41 above may be changed according to the following equation.

$\begin{matrix} \begin{matrix} {W_{1} = {\frac{1}{2}\begin{bmatrix} 1 & j & {- 1} & j \\ {- j} & 1 & {- j} & 1 \\ {- 1} & j & 1 & j \\ j & 1 & j & 1 \end{bmatrix}}} \\ {W_{3} = {\frac{1}{2}\begin{bmatrix} 1 & {- j} & {- 1} & j \\ j & 1 & j & 1 \\ {- 1} & {- j} & 1 & j \\ {- j} & 1 & {- j} & 1 \end{bmatrix}}} \\ {W_{9} = {\frac{1}{2}\begin{bmatrix} 1 & j & 1 & j \\ {- j} & 1 & j & {- 1} \\ 1 & {- j} & 1 & {- j} \\ {- j} & {- 1} & j & 1 \end{bmatrix}}} \\ {W_{11} = {\frac{1}{2}\begin{bmatrix} 1 & {- j} & 1 & {- j} \\ j & 1 & {- j} & {- 1} \\ 1 & j & 1 & j \\ j & {- 1} & {- j} & 1 \end{bmatrix}}} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 42} \right\rbrack \end{matrix}$

Next, each matrix for an 8PSK modulation method of 4 TX codebook of rank 4 is as follows.

$\begin{matrix} {W_{4} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{1 - j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} & j \\ j & \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} & 1 \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 43} \right\rbrack \\ {W_{7} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{1 + j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} & {- j} \\ {- j} & \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} & 1 \end{bmatrix}}} & \; \\ {W_{5} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} - j}{\sqrt{2}} & j & \frac{1 - j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} & {- j} \\ {- j} & \frac{1 - j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & j & \frac{1 - j}{\sqrt{2}} & 1 \end{bmatrix}}} & \mspace{11mu} \\ {W_{6} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} & j \\ j & \frac{1 + j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} & 1 \end{bmatrix}}} & \; \end{matrix}$

In addition, signs of imaginary numbers of each matrix of Equation 43 above may be changed according to the following equation.

$\begin{matrix} {W_{4} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{1 + j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} & {- j} \\ {- j} & \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & j & \frac{{- 1} + j}{\sqrt{2}} & 1 \end{bmatrix}}} \\ {W_{7} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{1 - j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} & j \\ j & \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{{- 1} - j}{\sqrt{2}} & 1 \end{bmatrix}}} \\ {W_{5} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} + j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} & j \\ j & \frac{1 + j}{\sqrt{2}} & 1 & \frac{1 - j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & {- j} & \frac{1 + j}{\sqrt{2}} & 1 \end{bmatrix}}} \\ {W_{6} = {\frac{1}{2}\begin{bmatrix} 1 & \frac{{- 1} - j}{\sqrt{2}} & {- j} & \frac{1 - j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} & {- j} \\ {- j} & \frac{1 - j}{\sqrt{2}} & 1 & \frac{1 + j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & j & \frac{1 - j}{\sqrt{2}} & 1 \end{bmatrix}}} \end{matrix}$

As another example, when a rank is 3, three column vectors may be selected in the aforementioned 4 TX codebook of rank 4 using a predetermined method and 1/?? instead of 1/2 of a front part of a matrix may be multiplied for normalization. In detail, when a rank is 3, the 4 TX codebook is as follows.

First, each matrix for a BPSK modulation method of 4 TX codebook of rank 3 is as follows.

$\begin{matrix} {W_{0} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & {- 1} \\ 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 44} \right\rbrack \\ {W_{2} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \\ 1 & 1 & 1 \\ {- 1} & {- 1} & 1 \end{bmatrix}}} & \; \\ {W_{8} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- 1} \\ 1 & 1 & 1 \\ {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 \end{bmatrix}}} & \; \\ {W_{10} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & 1 \\ 1 & 1 & 1 \end{bmatrix}}} & \; \\ {W_{12} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & {- 1} \\ 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \end{bmatrix}}} & \; \\ {W_{13} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- 1} \\ 1 & 1 & 1 \\ {- 1} & 1 & 1 \\ 1 & {- 1} & 1 \end{bmatrix}}} & \; \\ {W_{14} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & {- 1} \end{bmatrix}}} & \; \\ {\; {W_{15} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & 1 \\ {- 1} & {- 1} & {- 1} \end{bmatrix}}}} & \; \end{matrix}$

Next, each matrix for a QPSK modulation method of 4 TX codebook of rank 3 is as follows.

$\begin{matrix} \begin{matrix} {W_{1} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- j} & {- 1} \\ j & 1 & j \\ {- 1} & {- j} & 1 \\ {- j} & 1 & {- j} \end{bmatrix}}} \\ {W_{3} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & j & {- 1} \\ {- j} & 1 & {- j} \\ {- 1} & j & 1 \\ j & 1 & j \end{bmatrix}}} \\ {W_{9} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- j} \\ j & {- j} & {- 1} \\ 1 & 1 & j \\ j & {- j} & 1 \end{bmatrix}}} \\ {W_{11} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & j \\ {- j} & j & {- 1} \\ 1 & 1 & {- j} \\ {- j} & j & 1 \end{bmatrix}}} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 45} \right\rbrack \end{matrix}$

Next, each matrix for an 8PSK modulation method of 4 TX codebook of rank 3 is as follows.

$\begin{matrix} \begin{matrix} {W_{4} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & \frac{1 - j}{\sqrt{2}} & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & 1 & j \\ j & \frac{{- 1} - j}{\sqrt{2}} & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & {- j} & 1 \end{bmatrix}}} \\ {W_{7} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & j & \frac{{- 1} + j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & \frac{{- 1} - j}{\sqrt{2}} & {- j} \\ {- j} & 1 & \frac{{- 1} - j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & \frac{{- 1} + j}{\sqrt{2}} & 1 \end{bmatrix}}} \\ {W_{5} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & \frac{{- 1} - j}{\sqrt{2}} & \frac{1 - j}{\sqrt{2}} \\ \frac{{- 1} + j}{\sqrt{2}} & 1 & {- j} \\ {- j} & \frac{1 - j}{\sqrt{2}} & \frac{1 + j}{\sqrt{2}} \\ \frac{1 + j}{\sqrt{2}} & j & 1 \end{bmatrix}}} \\ {W_{6} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- j} & \frac{1 + j}{\sqrt{2}} \\ \frac{{- 1} - j}{\sqrt{2}} & \frac{1 - j}{\sqrt{2}} & j \\ j & 1 & \frac{1 - j}{\sqrt{2}} \\ \frac{1 - j}{\sqrt{2}} & \frac{1 + j}{\sqrt{2}} & 1 \end{bmatrix}}} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 46} \right\rbrack \end{matrix}$

As a first principle for sampling a codebook according to the present invention, an alphabet constituting each codeword is considered. A matrix for the BPSK modulation method has only a real number, but a QPSK or 8PSK matrix also has an imaginary number. When a UE is embodied, since computational load is increased due to the imaginary values, it is advantageous to design a codebook configured with values of the BPSK matrix.

As a second principle for sampling a codebook, channel properties in a high rank is considered. Since X-pol and ULA antennas have different channel properties, it is optimum to use different codebooks dedicated to the respective antenna configurations. However, as described above, since performance is not affected by a codebook in a high rank compared with a low rank, one codebook may be used in terms of complexity.

As a third principle for sampling a codebook, the channel property of the X-pol antenna is considered. A codebook for generation of one codebook that is appropriately operated in both X-pol and ULA need to appropriately reflect the channel properties of both antenna configurations. As described above, in terms of ULA, a column vector indicating each beam may have linear phase increase attributes. However, in ULA with a narrow antenna interval, the probability that a high rank occurs is reduced, and in ULA with a wide antenna interval, the probability that a singular vector of a channel does not have linear phase increase attributes is high, and thus it is not appropriate to maintain the linear phase increase attributes of a codebook in a high rank. Accordingly, it may be appropriate to design a more optimum codebook compared with the X-pol channel As described above, the X-pol channel is configured in such a way that channels of a horizontal antenna and a vertical antenna have the same value and a phase difference between the two antennas is present. Accordingly, in a release-8 codebook, it may be appropriate to select a codebook with this configuration maintained.

In consideration of the three above principles, hereinafter, a codebook for rank 3 or 4 configured with 1 bit, 2 bits, and 3 bits according to the present invention is proposed.

First, the codebook for rank 3 or 4 configured with 1 bit according to the present invention may be configured as follows.

The 1-bit codebook may be configured with only W0 and W2 in Equation 40 to Equation 18. Release-8 method may be applied to permutation of a column vector and selection of a column vector for each rank without changes.

The 1-bit codebook according to the present invention is configured with BPSK values according to the first principle and is commonly applied to all antenna configurations according to the second principle, and satisfies a channel configuration of the X-pol according to the third principle.

Next, a codebook for rank 3 or 4 of 2 bits according to the present invention may be configured as follows.

The 2-bit codebook according to the present invention may be configured with only W0, W2, W8, and W10 in the aforementioned codebook for ranks 3 and 4.

For example, a codebook index of 0, 2, 8, and 10 may be induced by applying a second PMI index I_(PMI2) having one of 0 to 3 to the following equation.

2I_(PMI2)+4·└I_(PMI)2/2┘  [Equation 47]

As described above, the release-8 method may be applied to permutation of a column vector and selection of a column vector for each rank without changes.

The 2-bit codebook according to the present invention is configured with BPSK values according to the first principle and is commonly applied to all antenna configurations according to the second principle, and satisfies a channel configuration of the X-pol according to the third principle.

Next, a codebook for rank 3 or 4 of 3 bits according to the present invention may be configured as follows.

The 3-bit codebook according to the present invention may be configured with only W0, W2, W8, W10, W12, W13, W14, and W15 in Equation 40. Release-8 method may be applied to permutation of a column vector and selection of a column vector for each rank without changes.

The 3-bit codebook according to the present invention is configured with BPSK values according to the first principle and is commonly applied to all antenna configurations according to the second principle. However, W12, W13, W14, and W15 do not satisfy the channel configuration of the X-pol, and thus the third principle is not satisfied.

Another 3-bit codebook is configured with only W0, W2, W8, W10, W1, W3, W9, and W11 in Equations 40 to 42. The release-8 method may be applied to permutation of a column vector and selection of a column vector for each rank without changes. The codebook does not satisfy the first principle. However, the codebook is commonly applied to all antenna configurations according to the second principle and satisfies the channel configuration of the X-pol according to the third principle.

Next, as a 0-bit codebook according to the present invention, although rank 3 uses the aforementioned codebook, a codebook may not be formed with respect to rank 4. That is, the rank 4 codebook is fixed to a 4 by 4 identity matrix.

With reference to FIG. 15, a method for reporting channel state (CSI) according to an embodiment of the present invention will be described.

In operation S151, a UE subsamples a codebook for a 4 antenna port including 16 precoding matrices.

A detailed subsampling method is the same as a method for subsampling the aforementioned codebook for ranks 3 and 4, and thus a detailed description thereof will be omitted.

In operation S153, the UE feedbacks CSI based on the subsampled codebook.

For example, when a rank is 3 or 4, the subsampled codebook includes a first precoding matrix with index 0, a third precoding matrix with index 2, a ninth precoding matrix with index 8, and an eleventh precoding matrix with index 10 among the aforementioned 16 precoding matrices.

With regard to the channel state information transmitting method of FIG. 15, the aforementioned various embodiments of the present invention are independently applied or two or more embodiments are simultaneously applied and descriptions of redundant parts are omitted for clarity.

In addition, the same idea as that proposed by the present invention can also be applied to uplink MIMO transmission and reception for MIMO transmission between a BS and a relay (in backhaul uplink and backhaul downlink) and MIMO transmission between a relay and a UE (in access uplink and access downlink).

BS and UE to Which Embodiments of the Present Invention are Applicable

FIG. 16 is a diagram illustrating a BS 110 and a UE 120 to which an embodiment of the present invention is applicable.

When a relay is included in a wireless communication system, communication in backhaul link is performed between the BS and the relay, and communication in access link is performed between the relay and the UE. Accordingly, the BS or the UE illustrated in FIG. 16 may be replaced by a relay as necessary.

Referring to FIG. 16, the wireless communication system includes a BS 110 and a UE 120. The BS 110 includes a processor 112, a memory 114, and a radio frequency (RF) unit 116. The processor 112 may be configured to embody procedures and/or methods proposed by the present invention. The memory 114 is connected to the processor 112 and stores various information related to an operation of the processor 112. The RF unit 116 is connected to the processor 112 and transmits and/or receives a radio signal. The UE 120 includes a processor 122, a memory 124, and an RF unit 126. The processor 122 may be configured to embody procedures and/or methods proposed by the present invention. The memory 124 is connected to the processor 122 and stores various information related to an operation of the processor 122. The RF unit 126 is connected to the processor 122 and transmits and/or receives a radio signal. The BS 110 and/or the UE 120 may have a single antenna or a multiple antenna.

The embodiments of the present invention described herein below are combinations of elements and features of the present invention. The elements or features may be considered selective unless otherwise mentioned. Each element or feature may be practiced without being combined with other elements or features. Further, an embodiment of the present invention may be constructed by combining parts of the elements and/or features. Operation orders described in embodiments of the present invention may be rearranged. Some constructions of any one embodiment may be included in another embodiment and may be replaced with corresponding constructions of another embodiment. It is obvious to those skilled in the art that claims that are not explicitly cited in each other in the appended claims may be presented in combination as an embodiment of the present invention or included as a new claim by a subsequent amendment after the application is filed.

In the embodiments of the present invention, a specific operation described as being performed by the BS may be performed by an upper node of the BS. Namely, it is apparent that, in a network comprised of a plurality of network nodes including a BS, various operations performed for communication with a UE may be performed by the BS, or network nodes other than the BS. The term ‘BS’ may be replaced with a fixed station, a Node B, an eNode B (eNB), an access point, etc.

The embodiments according to the present invention can be implemented by various means, for example, hardware, firmware, software, or combination thereof. In a hardware configuration, the embodiments of the present invention may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, etc.

In a firmware or software configuration, the embodiments of the present invention can be implemented by a type of a module, a procedure, or a function, which performs functions or operations described above. Software code may be stored in a memory unit and then may be executed by a processor.

The memory unit may be located inside or outside the processor to transmit and receive data to and from the processor through various means which are well known.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.

INDUSTRIAL APPLICABILITY

The above-described embodiments of the present invention can be applied to a wireless communication system such as a user equipment (UE), a relay, a base station (BS), etc. 

What is claimed is:
 1. A method for transmitting a Precoding Matrix Indicator (PMI) by a user equipment (UE) in a wireless communication system, the method comprising: determining the PMI, the UE being restricted to use only 4 precoding matrices out of 16 precoding matrices in a codebook, the determining comprising selecting one precoding matrix of the 4 precoding matrices, and the determined PMI corresponding to the selected one precoding matrix of the 4 precoding matrices; and reporting the PMI to a base station (BS), wherein the 4 precoding matrices are composed of 3 column vectors of each of a precoding matrix W0, a precoding matrix W2, a precoding matrix W8 and a precoding matrix W10, where W0, W2, W8 and W10 are as follows: $\begin{matrix} \begin{matrix} {{W_{0} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \end{bmatrix}}},} \\ {{W_{8} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} \\ {- 1} & 1 & {- 1} & 1 \end{bmatrix}}},{and}} \\ {W_{10} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & 1 \\ {- 1} & 1 & {- 1} & 1 \\ {- 1} & {- 1} & 1 & 1 \\ 1 & 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix} & \; \end{matrix}$
 2. The method according to claim 1, wherein each of the 4 precoding matrices is a 4 by 3 matrix.
 3. The method according to claim 1, wherein the 4 precoding matrices are composed of a precoding matrix W0′, a precoding matrix W2′, a precoding matrix W8′ and a precoding matrix W10′, where W0′, W2′, W8′ and W10′ are as follows: $\begin{matrix} {{W_{0}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & {- 1} \\ 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \\ 1 & 1 & 1 \\ {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{8}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- 1} \\ 1 & 1 & 1 \\ {- 1} & 1 & 1 \\ {- 1} & 1 & {- 1} \end{bmatrix}}},\; {and}} \\ {W_{10}^{\;^{\prime}} = {{\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & 1 \\ 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix}$
 4. The method according to claim 1, wherein the PMI is reported to the BS according to a specific physical uplink control channel (PUCCH) mode.
 5. The method according to claim 1, wherein a payload size for reporting the PMI is 2 bits.
 6. The method according to claim 1, further comprising: receiving configuration information from the BS, the configuration information indicating that the UE being restricted to use only the 4 precoding matrices out of the 16 precoding matrices.
 7. The method according to claim 1, further comprising: measuring a channel state between the UE and the BS, wherein the PMI is determined based on the channel state.
 8. A user equipment (UE) for transmitting a Precoding Matrix Indicator (PMI) in a wireless communication system, the UE comprising: a radio frequency (RF) unit; and a processor, wherein: the processor is configured to: determine the PMI, the UE being restricted to use only 4 precoding matrices out of 16 precoding matrices in a codebook, the determining comprising selecting one precoding matrix of the 4 precoding matrices, and the determined PMI corresponding to the selected one precoding matrix of the 4 precoding matrices, and control the RF unit to report the PMI to a base station (BS), wherein the 4 precoding matrices are composed of 3 column vectors of each of a precoding matrix W0, a precoding matrix W2, a precoding matrix W8 and a precoding matrix W10, where W0, W2, W8 and W10 are as follows: $\begin{matrix} {{W_{0} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \end{bmatrix}}},} \\ {{W_{8} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} \\ {- 1} & 1 & {- 1} & 1 \end{bmatrix}}},\; {and}} \\ {W_{10} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & 1 \\ {- 1} & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \\ 1 & 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix}$
 9. The method according to claim 8, wherein each of the 4 precoding matrices is a 4 by 3 matrix.
 10. The method according to claim 8, wherein the 4 precoding matrices are composed of a precoding matrix W0′, a precoding matrix W2′, a precoding matrix W8′ and a precoding matrix W10′, where W0′, W2′, W8′ and W10′ are as follows: $\begin{matrix} {{W_{0}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & {- 1} \\ 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \\ 1 & 1 & 1 \\ {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{8}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- 1} \\ 1 & 1 & 1 \\ {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 \end{bmatrix}}},\; {and}} \\ {W_{10}^{\;^{\prime}} = {{\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & 1 \\ 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix}$
 11. The method according to claim 8, wherein the PMI is reported to the BS according to a specific physical uplink control channel (PUCCH) mode.
 12. The method according to claim 8, wherein a payload size for reporting the PMI is 2 bits.
 13. A method for receiving a Precoding Matrix Indicator (PMI) by a base station (BS) in a wireless communication system, the method comprising: receiving the PMI from a user equipment (UE), the UE being restricted to use only 4 precoding matrices out of 16 precoding matrices in a codebook, the PMI being determined by selecting one precoding matrix of the 4 precoding matrices, and the determined PMI corresponding to the selected one precoding matrix of the 4 precoding matrices; determining a precoding matrix based on the PMI; and transmitting a data signal by applying the determined precoding matrix via 4 transmit antenna ports, wherein the 4 precoding matrices are composed of 3 column vectors of each of a precoding matrix W0, a precoding matrix W2, a precoding matrix W8 and a precoding matrix W10, where W0, W2, W8 and W10 are as follows: $\begin{matrix} {{W_{0} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2} = {\frac{1}{2}\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \end{bmatrix}}},} \\ {{W_{8} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} \\ 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} \\ {- 1} & 1 & {- 1} & 1 \end{bmatrix}}},\; {and}} \\ {W_{10} = {{\frac{1}{2}\begin{bmatrix} 1 & {- 1} & {- 1} & 1 \\ {- 1} & 1 & 1 & 1 \\ {- 1} & {- 1} & 1 & 1 \\ 1 & 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix}$
 14. The method according to claim 13, wherein each of the 4 precoding matrices is a 4 by 3 matrix.
 15. The method according to claim 13, wherein the 4 precoding matrices are composed of a precoding matrix W0′, a precoding matrix W2′, a precoding matrix W8′ and a precoding matrix W10′, where W0′, W2′, W8′ and W10′ are as follows: $\begin{matrix} {{W_{0}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & {- 1} \\ 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{2}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & 1 \\ {- 1} & 1 & 1 \\ 1 & 1 & 1 \\ {- 1} & {- 1} & 1 \end{bmatrix}}},} \\ {{W_{8}^{\;^{\prime}} = {\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & 1 & {- 1} \\ 1 & 1 & 1 \\ {- 1} & 1 & {- 1} \\ {- 1} & 1 & 1 \end{bmatrix}}},\; {and}} \\ {W_{10}^{\;^{\prime}} = {{\frac{1}{\sqrt{3}}\begin{bmatrix} 1 & {- 1} & {- 1} \\ {- 1} & 1 & {- 1} \\ {- 1} & {- 1} & 1 \\ 1 & 1 & 1 \end{bmatrix}}.}} \end{matrix}$
 16. The method according to claim 13, wherein a payload size for receiving the PMI is 2 bits.
 17. The method according to claim 13, further comprising: transmitting configuration information to the UE, the configuration information indicating that the UE being restricted to use only the 4 precoding matrices out of the 16 precoding matrices. 